%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN150-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 09:16:54 AM UTC 2026
% Result : Unsatisfiable 134.40s 66.98s
% Output : Refutation 134.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 93 ( 15 ~; 12 |; 0 &; 66 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(n2_decl,type,
n2: $i > $o ).
thf(b_decl,type,
b: $i ).
thf(p0_decl,type,
p0: $i > $i > $o ).
thf(p1_decl,type,
p1: $i > $i > $i > $o ).
thf(296,axiom,
! [A: $i] : ( A @ ( b @ p0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
thf(933,plain,
! [A: $i] : ( A @ ( b @ p0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[296]) ).
thf(276,axiom,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ p0 ) )
| ( B @ ( A @ ( A @ p1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_069) ).
thf(900,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ p0 ) )
| ( B @ ( A @ ( A @ p1 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[276]) ).
thf(901,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ p0 ) )
| ( B @ ( A @ ( A @ p1 ) ) ) ),
inference(cnf,[status(esa)],[900]) ).
thf(38328,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( b @ p0 ) )
!= ( B @ ( C @ p0 ) ) )
| ~ $true
| ( C @ ( B @ ( B @ p1 ) ) ) ),
inference(paramod_ordered,[status(thm)],[933,901]) ).
thf(38329,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( b @ p0 ) )
!= ( B @ ( C @ p0 ) ) )
| ( C @ ( B @ ( B @ p1 ) ) ) ),
inference(simp,[status(thm)],[38328]) ).
thf(38330,plain,
! [A: $i] : ( b @ ( A @ ( A @ p1 ) ) ),
inference(pattern_uni,[status(thm)],[38329:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( b ))]]) ).
thf(315,axiom,
! [C: $i,B: $i,A: $i] :
( ~ ( A @ ( C @ ( B @ p1 ) ) )
| ( A @ n2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).
thf(969,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( A @ ( C @ ( B @ p1 ) ) )
| ( A @ n2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[315]) ).
thf(970,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( A @ ( C @ ( B @ p1 ) ) )
| ( A @ n2 ) ),
inference(cnf,[status(esa)],[969]) ).
thf(42535,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( b @ ( A @ ( A @ p1 ) ) )
!= ( B @ ( D @ ( C @ p1 ) ) ) )
| ~ $true
| ( B @ n2 ) ),
inference(paramod_ordered,[status(thm)],[38330,970]) ).
thf(42536,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( b @ ( A @ ( A @ p1 ) ) )
!= ( B @ ( D @ ( C @ p1 ) ) ) )
| ( B @ n2 ) ),
inference(simp,[status(thm)],[42535]) ).
thf(42537,plain,
b @ n2,
inference(pattern_uni,[status(thm)],[42536:[bind(A,$thf( A )),bind(B,$thf( b )),bind(C,$thf( A )),bind(D,$thf( A ))]]) ).
thf(1,negated_conjecture,
~ ( b @ n2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(370,plain,
~ ( b @ n2 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(371,plain,
~ ( b @ n2 ),
inference(polarity_switch,[status(thm)],[370]) ).
thf(42584,plain,
$false,
inference(rewrite,[status(thm)],[42537,371]) ).
thf(42585,plain,
$false,
inference(simp,[status(thm)],[42584]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN150-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sat Sep 26 17:18:40 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.39 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.85/0.97 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.46/1.25 % [INFO] Parsing done (274ms).
% 1.46/1.26 % [INFO] Running in sequential loop mode.
% 2.72/1.66 % [INFO] eprover registered as external prover.
% 2.72/1.66 % [INFO] Scanning for conjecture ...
% 2.92/1.80 % [INFO] Found a conjecture (or negated_conjecture) and 368 axioms. Running axiom selection ...
% 3.48/1.94 % [INFO] Axiom selection finished. Selected 368 axioms (removed 0 axioms).
% 3.99/2.12 % [INFO] Problem is propositional (TPTP CNF).
% 3.99/2.13 % [INFO] Type checking passed.
% 4.22/2.13 % [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 ...
% 134.40/66.97 % [INFO] Killing All external provers ...
% 134.40/66.98 % Time passed: 66437ms (effective reasoning time: 65705ms)
% 134.40/66.98 % Axioms used in derivation (3): axiom_14, rule_069, rule_137
% 134.40/66.98 % No. of inferences in proof: 19
% 134.40/66.98 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 66437 ms resp. 65705 ms w/o parsing
% 134.40/67.02 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 134.40/67.02 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------