%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO081^5 : TPTP v9.3.1. Released v4.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 : n016.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:11 AM UTC 2026
% Result : Theorem 2.13s 1.19s
% Output : Refutation 2.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 43 ( 8 ~; 1 |; 1 &; 30 @)
% ( 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 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 ^; 12 !; 3 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(cB_decl,type,
cB: $i ).
thf(cR_decl,type,
cR: $i > $i > $o ).
thf(cA_decl,type,
cA: $i ).
thf(1,conjecture,
( ! [A: $i] : ( cR @ A @ cA )
=> ? [A: $i] : ( cR @ cB @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM137) ).
thf(2,negated_conjecture,
~ ( ! [A: $i] : ( cR @ A @ cA )
=> ? [A: $i] : ( cR @ cB @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i] : ( cR @ A @ cA )
=> ? [A: $i] : ( cR @ cB @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i,A: $i] :
( ( cR @ A @ cA )
& ~ ( cR @ cB @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i] : ( cR @ A @ cA ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
! [A: $i] :
~ ( cR @ cB @ A ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [A: $i] :
~ ( cR @ cB @ A ),
inference(simp,[status(thm)],[6]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( cR @ A @ cA )
!= ( cR @ cB @ B ) ) ),
inference(paramod_ordered,[status(thm)],[5,7]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( cR @ A @ cA )
!= ( cR @ cB @ B ) ),
inference(simp,[status(thm)],[8]) ).
thf(10,plain,
$false,
inference(pattern_uni,[status(thm)],[9:[bind(A,$thf( cB )),bind(B,$thf( cA ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO081^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % 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.10/0.21 % Computer : n016.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Tue Sep 29 16:37:49 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 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.64/0.54 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.99/0.63 % [INFO] Parsing done (94ms).
% 0.99/0.64 % [INFO] Running in sequential loop mode.
% 1.27/0.84 % [INFO] eprover registered as external prover.
% 1.27/0.84 % [INFO] Scanning for conjecture ...
% 1.27/0.88 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.54/0.90 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.54/0.90 % [INFO] Problem is higher-order (TPTP THF).
% 1.54/0.91 % [INFO] Type checking passed.
% 1.54/0.91 % [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.13/1.19 % [INFO] Killing All external provers ...
% 2.13/1.19 % Time passed: 879ms (effective reasoning time: 547ms)
% 2.13/1.19 % 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.13/1.19 % Axioms used in derivation (0):
% 2.13/1.19 % No. of inferences in proof: 10
% 2.13/1.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 879 ms resp. 547 ms w/o parsing
% 2.42/1.22 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.42/1.22 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------