TSTP Solution File: ALG001^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : ALG001^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:15:41 EDT 2024
% Result : Theorem 2.79s 1.81s
% Output : Refutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 24 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 20 ( 19 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 162 ( 7 ~; 0 |; 3 &; 149 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 ^ 43 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(g_type,type,
g: $tType ).
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: g > b ).
thf(sk2_type,type,
sk2: b > a ).
thf(sk3_type,type,
sk3: g > g > g ).
thf(sk4_type,type,
sk4: b > b > b ).
thf(sk5_type,type,
sk5: a > a > a ).
thf(sk6_type,type,
sk6: g ).
thf(sk7_type,type,
sk7: g ).
thf(1,conjecture,
! [A: g > b,B: b > a,C: g > g > g,D: b > b > b,E: a > a > a] :
( ( ! [F: g,G: g] :
( ( A @ ( C @ F @ G ) )
= ( D @ ( A @ F ) @ ( A @ G ) ) )
& ! [F: b,G: b] :
( ( B @ ( D @ F @ G ) )
= ( E @ ( B @ F ) @ ( B @ G ) ) ) )
=> ! [F: g,G: g] :
( ( B @ ( A @ ( C @ F @ G ) ) )
= ( E @ ( B @ ( A @ F ) ) @ ( B @ ( A @ G ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM133_pme) ).
thf(2,negated_conjecture,
~ ! [A: g > b,B: b > a,C: g > g > g,D: b > b > b,E: a > a > a] :
( ( ! [F: g,G: g] :
( ( A @ ( C @ F @ G ) )
= ( D @ ( A @ F ) @ ( A @ G ) ) )
& ! [F: b,G: b] :
( ( B @ ( D @ F @ G ) )
= ( E @ ( B @ F ) @ ( B @ G ) ) ) )
=> ! [F: g,G: g] :
( ( B @ ( A @ ( C @ F @ G ) ) )
= ( E @ ( B @ ( A @ F ) ) @ ( B @ ( A @ G ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: g > b,B: b > a,C: g > g > g,D: b > b > b,E: a > a > a] :
( ( ! [F: g,G: g] :
( ( A @ ( C @ F @ G ) )
= ( D @ ( A @ F ) @ ( A @ G ) ) )
& ! [F: b,G: b] :
( ( B @ ( D @ F @ G ) )
= ( E @ ( B @ F ) @ ( B @ G ) ) ) )
=> ! [F: g,G: g] :
( ( B @ ( A @ ( C @ F @ G ) ) )
= ( E @ ( B @ ( A @ F ) ) @ ( B @ ( A @ G ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( sk2 @ ( sk1 @ ( sk3 @ sk6 @ sk7 ) ) )
!= ( sk5 @ ( sk2 @ ( sk1 @ sk6 ) ) @ ( sk2 @ ( sk1 @ sk7 ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( ( sk5 @ ( sk2 @ ( sk1 @ sk6 ) ) @ ( sk2 @ ( sk1 @ sk7 ) ) )
!= ( sk2 @ ( sk1 @ ( sk3 @ sk6 @ sk7 ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(5,plain,
! [B: b,A: b] :
( ( sk2 @ ( sk4 @ A @ B ) )
= ( sk5 @ ( sk2 @ A ) @ ( sk2 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: b,A: b] :
( ( sk5 @ ( sk2 @ A ) @ ( sk2 @ B ) )
= ( sk2 @ ( sk4 @ A @ B ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(9,plain,
! [B: b,A: b] :
( ( sk5 @ ( sk2 @ A ) @ ( sk2 @ B ) )
= ( sk2 @ ( sk4 @ A @ B ) ) ),
inference(simp,[status(thm)],[8]) ).
thf(11,plain,
( ( sk2 @ ( sk4 @ ( sk1 @ sk6 ) @ ( sk1 @ sk7 ) ) )
!= ( sk2 @ ( sk1 @ ( sk3 @ sk6 @ sk7 ) ) ) ),
inference(rewrite,[status(thm)],[7,9]) ).
thf(12,plain,
( ( sk4 @ ( sk1 @ sk6 ) @ ( sk1 @ sk7 ) )
!= ( sk1 @ ( sk3 @ sk6 @ sk7 ) ) ),
inference(simp,[status(thm)],[11]) ).
thf(6,plain,
! [B: g,A: g] :
( ( sk1 @ ( sk3 @ A @ B ) )
= ( sk4 @ ( sk1 @ A ) @ ( sk1 @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: g,A: g] :
( ( sk4 @ ( sk1 @ A ) @ ( sk1 @ B ) )
= ( sk1 @ ( sk3 @ A @ B ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(15,plain,
( ( sk1 @ ( sk3 @ sk6 @ sk7 ) )
!= ( sk1 @ ( sk3 @ sk6 @ sk7 ) ) ),
inference(rewrite,[status(thm)],[12,10]) ).
thf(16,plain,
$false,
inference(simp,[status(thm)],[15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG001^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sat May 18 23:24:39 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.94/0.92 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/1.04 % [INFO] Parsing done (123ms).
% 1.32/1.05 % [INFO] Running in sequential loop mode.
% 1.71/1.31 % [INFO] nitpick registered as external prover.
% 1.71/1.32 % [INFO] Scanning for conjecture ...
% 1.93/1.39 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.93/1.42 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.93/1.42 % [INFO] Problem is higher-order (TPTP THF).
% 2.05/1.43 % [INFO] Type checking passed.
% 2.05/1.43 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.79/1.81 % [INFO] Killing All external provers ...
% 2.79/1.81 % Time passed: 1283ms (effective reasoning time: 754ms)
% 2.79/1.81 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.79/1.81 % Axioms used in derivation (0):
% 2.79/1.81 % No. of inferences in proof: 14
% 2.79/1.81 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1283 ms resp. 754 ms w/o parsing
% 3.02/1.89 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.02/1.89 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------