%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN983_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n010.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:20:33 AM UTC 2026
% Result : Theorem 4.00s 2.28s
% Output : Refutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 84 ( 7 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 64 ( 13 ~; 6 |; 19 &; 23 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_decl,type,
a: $o ).
thf(b_decl,type,
b: $o ).
thf(p_decl,type,
p: $o > $o ).
thf(1,conjecture,
( ( ( b @ p )
& ( a @ p ) )
=> ( ( b
& a )
@ p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ( ( ( b @ p )
& ( a @ p ) )
=> ( ( b
& a )
@ p ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( b @ p )
& ( a @ p ) )
=> ( ( b
& a )
@ p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ~ ( ( b
& a )
@ p )
& ( b @ p )
& ( a @ p ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
b @ p,
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
~ ( ( b
& a )
@ p ),
inference(cnfConj,[status(thm)],[4]) ).
thf(10,plain,
( ( ( ( b
& a )
@ p )
!= ( b @ p ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(11,plain,
( ( ( b
& a )
@ p )
!= ( b @ p ) ),
inference(simp,[status(thm)],[10]) ).
thf(13,plain,
( ( b
& a )
!= b ),
inference(simp,[status(thm)],[11]) ).
thf(5,plain,
a @ p,
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
( ( ( ( b
& a )
@ p )
!= ( a @ p ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[5,7]) ).
thf(9,plain,
( ( ( b
& a )
@ p )
!= ( a @ p ) ),
inference(simp,[status(thm)],[8]) ).
thf(12,plain,
( ( b
& a )
!= a ),
inference(simp,[status(thm)],[9]) ).
thf(15,plain,
( a
| ( b
& a ) ),
inference(bool_ext,[status(thm)],[12]) ).
thf(18,plain,
( ( a
| b )
& ( a
| a ) ),
inference(cnf,[status(esa)],[15]) ).
thf(19,plain,
( a
| a ),
inference(cnfConj,[status(thm)],[18]) ).
thf(21,plain,
a,
inference(simp,[status(thm)],[19]) ).
thf(31,plain,
( ( b
& $true )
!= b ),
inference(rewrite,[status(thm)],[13,21]) ).
thf(32,plain,
$false,
inference(simp,[status(thm)],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN983_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.13 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.22/0.48 % Computer : n010.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Sat Sep 26 18:53:30 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.98/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.31/1.13 % [INFO] Parsing done (144ms).
% 1.31/1.14 % [INFO] Running in sequential loop mode.
% 1.91/1.47 % [INFO] eprover registered as external prover.
% 1.91/1.48 % [INFO] Scanning for conjecture ...
% 2.13/1.57 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.33/1.61 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.33/1.61 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.33/1.61 % [INFO] Type checking passed.
% 2.33/1.62 % [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 ...
% 4.00/2.27 % [INFO] Killing All external provers ...
% 4.00/2.27 % Time passed: 1637ms (effective reasoning time: 1124ms)
% 4.00/2.27 % 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)>
% 4.00/2.28 % Axioms used in derivation (0):
% 4.00/2.28 % No. of inferences in proof: 19
% 4.00/2.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1637 ms resp. 1124 ms w/o parsing
% 4.34/2.33 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.34/2.33 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------