%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO129^5 : TPTP v9.3.1. Released v4.0.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 : 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 : Wed Sep 30 08:45:16 AM UTC 2026
% Result : Theorem 2.95s 1.98s
% Output : Refutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 47 ( 11 ~; 6 |; 7 &; 20 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 5 con; 0-1 aty)
% Number of variables : 5 ( 0 ^; 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(c_decl,type,
c: $i ).
thf(cP_decl,type,
cP: $i > $o ).
thf(b_decl,type,
b: $i ).
thf(a_decl,type,
a: $i ).
thf(1,conjecture,
( ! [A: $i] : ( cP @ A )
=> ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cALLCONJ3) ).
thf(2,negated_conjecture,
~ ( ! [A: $i] : ( cP @ A )
=> ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i] : ( cP @ A )
=> ( ( cP @ a )
& ( cP @ b )
& ( cP @ c ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i] :
( ( cP @ A )
& ( ~ ( cP @ a )
| ~ ( cP @ b )
| ~ ( cP @ c ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
( ~ ( cP @ a )
| ~ ( cP @ b )
| ~ ( cP @ c ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(5,plain,
! [A: $i] : ( cP @ A ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
( ~ $true
| ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[6,5]) ).
thf(8,plain,
$false,
inference(simp,[status(thm)],[7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO129^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % 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.22 % Computer : n010.cluster.edu
% 0.12/0.22 % Model : x86_64 x86_64
% 0.12/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.22 % Memory : 8046.5625MB
% 0.12/0.22 % OS : Linux 6.8.0-71-generic
% 0.12/0.22 % CPULimit : 300
% 0.12/0.22 % WCLimit : 300
% 0.12/0.22 % DateTime : Tue Sep 29 16:34:48 UTC 2026
% 0.12/0.22 % CPUTime :
% 0.12/0.22 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
% 1.05/0.80 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/0.98 % [INFO] Parsing done (179ms).
% 1.27/0.99 % [INFO] Running in sequential loop mode.
% 1.89/1.39 % [INFO] eprover registered as external prover.
% 2.06/1.40 % [INFO] Scanning for conjecture ...
% 2.06/1.48 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.22/1.51 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.22/1.51 % [INFO] Problem is higher-order (TPTP THF).
% 2.22/1.52 % [INFO] Type checking passed.
% 2.22/1.52 % [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.95/1.98 % [INFO] Killing All external provers ...
% 2.95/1.98 % Time passed: 1612ms (effective reasoning time: 977ms)
% 2.95/1.98 % 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.95/1.98 % Axioms used in derivation (0):
% 2.95/1.98 % No. of inferences in proof: 8
% 2.95/1.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1612 ms resp. 977 ms w/o parsing
% 2.95/2.02 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.95/2.02 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------