%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN972+1 : TPTP v9.3.1. Released v3.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 : n019.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:31 AM UTC 2026
% Result : Theorem 3.34s 2.26s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 23 ( 4 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 48 ( 9 ~; 1 |; 1 &; 34 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 25 ( 0 ^; 16 !; 7 ?; 25 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(p_decl,type,
p: $i > $i > $o ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
! [B: $i] : ( B @ ( A @ p ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ? [B: $i] : ( A @ ( B @ p ) ) ) ) ).
thf(1,conjecture,
( ? [A: $i] :
! [B: $i] : ( B @ ( A @ p ) )
=> ! [A: $i] :
? [B: $i] : ( A @ ( B @ p ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ( ? [A: $i] :
! [B: $i] : ( B @ ( A @ p ) )
=> ! [A: $i] :
? [B: $i] : ( A @ ( B @ p ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ? [A: $i] :
! [B: $i] : ( B @ ( A @ p ) )
=> ! [A: $i] :
? [B: $i] : ( A @ ( B @ p ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i,A: $i] :
( ~ ( sk2 @ ( B @ p ) )
& ( A @ ( sk1 @ p ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i] : ( A @ ( sk1 @ p ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
! [A: $i] :
~ ( sk2 @ ( A @ p ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [A: $i] :
~ ( sk2 @ ( A @ p ) ),
inference(simp,[status(thm)],[6]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ( ( A @ ( sk1 @ p ) )
!= ( sk2 @ ( B @ p ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[5,7]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( A @ ( sk1 @ p ) )
!= ( sk2 @ ( B @ p ) ) ),
inference(simp,[status(thm)],[8]) ).
thf(10,plain,
$false,
inference(pattern_uni,[status(thm)],[9:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN972+1 : TPTP v9.3.1. Released v3.1.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.13/0.40 % Computer : n019.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Sat Sep 26 18:52:50 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 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.89/0.99 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.29/1.17 % [INFO] Parsing done (172ms).
% 1.29/1.18 % [INFO] Running in sequential loop mode.
% 1.83/1.58 % [INFO] eprover registered as external prover.
% 1.83/1.58 % [INFO] Scanning for conjecture ...
% 2.04/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.22/1.70 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.22/1.70 % [INFO] Problem is first-order (TPTP FOF).
% 2.22/1.71 % [INFO] Type checking passed.
% 2.22/1.71 % [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 ...
% 3.34/2.25 % [INFO] Killing All external provers ...
% 3.34/2.25 % Time passed: 1703ms (effective reasoning time: 1063ms)
% 3.34/2.25 % 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)>
% 3.34/2.26 % Axioms used in derivation (0):
% 3.34/2.26 % No. of inferences in proof: 10
% 3.34/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1703 ms resp. 1063 ms w/o parsing
% 3.61/2.30 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.61/2.30 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------