%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN036+1 : TPTP v9.3.1. Released v2.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 : n013.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:32 AM UTC 2026
% Result : Theorem 4.28s 7.44s
% Output : Refutation 4.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 0 equ; 0 cnn)
% Maximal formula atoms : 64 ( 20 avg)
% Number of connectives : 159 ( 2 ~; 0 |; 21 &; 80 @)
% ( 14 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 64 ( 0 ^; 32 !; 32 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_p_decl,type,
big_p: $i > $o ).
thf(big_q_decl,type,
big_q: $i > $o ).
thf(1,conjecture,
( ( ? [A: $i] :
! [B: $i] :
( ( A @ big_p )
<=> ( B @ big_p ) )
<=> ( ? [A: $i] : ( A @ big_q )
<=> ! [A: $i] : ( A @ big_q ) ) )
<=> ( ? [A: $i] :
! [B: $i] :
( ( A @ big_q )
<=> ( B @ big_q ) )
<=> ( ? [A: $i] : ( A @ big_p )
<=> ! [A: $i] : ( A @ big_p ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel34) ).
thf(2,negated_conjecture,
~ ( ( ? [A: $i] :
! [B: $i] :
( ( A @ big_p )
<=> ( B @ big_p ) )
<=> ( ? [A: $i] : ( A @ big_q )
<=> ! [A: $i] : ( A @ big_q ) ) )
<=> ( ? [A: $i] :
! [B: $i] :
( ( A @ big_q )
<=> ( B @ big_q ) )
<=> ( ? [A: $i] : ( A @ big_p )
<=> ! [A: $i] : ( A @ big_p ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( ( ( ( ! [A: $i] : ( A @ big_p )
=> ? [A: $i] : ( A @ big_p ) )
& ( ? [A: $i] : ( A @ big_p )
=> ! [A: $i] : ( A @ big_p ) ) )
=> ? [A: $i] :
! [B: $i] :
( ( ( B @ big_q )
=> ( A @ big_q ) )
& ( ( A @ big_q )
=> ( B @ big_q ) ) ) )
& ( ? [A: $i] :
! [B: $i] :
( ( ( B @ big_q )
=> ( A @ big_q ) )
& ( ( A @ big_q )
=> ( B @ big_q ) ) )
=> ( ( ! [A: $i] : ( A @ big_p )
=> ? [A: $i] : ( A @ big_p ) )
& ( ? [A: $i] : ( A @ big_p )
=> ! [A: $i] : ( A @ big_p ) ) ) ) )
=> ( ( ( ( ! [A: $i] : ( A @ big_q )
=> ? [A: $i] : ( A @ big_q ) )
& ( ? [A: $i] : ( A @ big_q )
=> ! [A: $i] : ( A @ big_q ) ) )
=> ? [A: $i] :
! [B: $i] :
( ( ( B @ big_p )
=> ( A @ big_p ) )
& ( ( A @ big_p )
=> ( B @ big_p ) ) ) )
& ( ? [A: $i] :
! [B: $i] :
( ( ( B @ big_p )
=> ( A @ big_p ) )
& ( ( A @ big_p )
=> ( B @ big_p ) ) )
=> ( ( ! [A: $i] : ( A @ big_q )
=> ? [A: $i] : ( A @ big_q ) )
& ( ? [A: $i] : ( A @ big_q )
=> ! [A: $i] : ( A @ big_q ) ) ) ) ) )
& ( ( ( ( ( ! [A: $i] : ( A @ big_q )
=> ? [A: $i] : ( A @ big_q ) )
& ( ? [A: $i] : ( A @ big_q )
=> ! [A: $i] : ( A @ big_q ) ) )
=> ? [A: $i] :
! [B: $i] :
( ( ( B @ big_p )
=> ( A @ big_p ) )
& ( ( A @ big_p )
=> ( B @ big_p ) ) ) )
& ( ? [A: $i] :
! [B: $i] :
( ( ( B @ big_p )
=> ( A @ big_p ) )
& ( ( A @ big_p )
=> ( B @ big_p ) ) )
=> ( ( ! [A: $i] : ( A @ big_q )
=> ? [A: $i] : ( A @ big_q ) )
& ( ? [A: $i] : ( A @ big_q )
=> ! [A: $i] : ( A @ big_q ) ) ) ) )
=> ( ( ( ( ! [A: $i] : ( A @ big_p )
=> ? [A: $i] : ( A @ big_p ) )
& ( ? [A: $i] : ( A @ big_p )
=> ! [A: $i] : ( A @ big_p ) ) )
=> ? [A: $i] :
! [B: $i] :
( ( ( B @ big_q )
=> ( A @ big_q ) )
& ( ( A @ big_q )
=> ( B @ big_q ) ) ) )
& ( ? [A: $i] :
! [B: $i] :
( ( ( B @ big_q )
=> ( A @ big_q ) )
& ( ( A @ big_q )
=> ( B @ big_q ) ) )
=> ( ( ! [A: $i] : ( A @ big_p )
=> ? [A: $i] : ( A @ big_p ) )
& ( ? [A: $i] : ( A @ big_p )
=> ! [A: $i] : ( A @ big_p ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(97,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN036+1 : TPTP v9.3.1. Released v2.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.14/5.41 % Computer : n013.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Sat Sep 26 17:04:30 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 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.17/5.81 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.17/5.99 % [INFO] Parsing done (177ms).
% 0.17/6.01 % [INFO] Running in sequential loop mode.
% 1.56/6.41 % [INFO] eprover registered as external prover.
% 1.56/6.42 % [INFO] Scanning for conjecture ...
% 1.93/6.51 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.93/6.55 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.93/6.55 % [INFO] Problem is first-order (TPTP FOF).
% 1.93/6.55 % [INFO] Type checking passed.
% 1.93/6.56 % [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.28/7.44 % External prover 'e' found a proof!
% 4.28/7.44 % [INFO] Killing All external provers ...
% 4.28/7.44 % Time passed: 1928ms (effective reasoning time: 1426ms)
% 4.28/7.44 % 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.28/7.44 % Axioms used in derivation (0):
% 4.28/7.44 % No. of inferences in proof: 4
% 4.28/7.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1928 ms resp. 1426 ms w/o parsing
% 4.28/7.49 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.28/7.49 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------