%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYN962+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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 Oct 7 11:07:14 AM UTC 2026
% Result : Theorem 0.10s 0.19s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 69 ( 20 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 37 ( 4 ~; 0 |; 4 &; 26 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 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 : 24 ( 0 ^; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_p,type,
p: $i > $o ).
thf(tp_sK1_X,type,
sK1_X: $i ).
thf(tp_sK2_Y,type,
sK2_Y: $i ).
thf(1,conjecture,
( ! [X: $i] : ( p @ X )
=> ( ! [X: $i] : ( p @ X )
& ! [Y: $i] : ( p @ Y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
( ( ! [X: $i] : ( p @ X )
=> ( ! [X: $i] : ( p @ X )
& ! [Y: $i] : ( p @ Y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: $i] : ( p @ X )
=> ( ! [X: $i] : ( p @ X )
& ! [Y: $i] : ( p @ Y ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] : ( p @ X ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [X: $i] : ( p @ X )
& ! [Y: $i] : ( p @ Y ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [X: $i] : ( p @ X ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(7,plain,
( ( ! [Y: $i] : ( p @ Y ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(8,plain,
( ( ~ ! [X: $i] : ( p @ X ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ! [Y: $i] : ( p @ Y ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [X: $i] : ( p @ X ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(11,plain,
( ( ~ ! [X: $i] : ( p @ X ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,plain,
! [SV1: $i] :
( ( p @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [X: $i] : ( p @ X ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( p @ sK1_X )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[13]) ).
thf(15,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,14]) ).
thf(16,plain,
( ( ! [X: $i] : ( p @ X ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(17,plain,
( ( ~ ! [Y: $i] : ( p @ Y ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(18,plain,
! [SV2: $i] :
( ( p @ SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(19,plain,
( ( ! [Y: $i] : ( p @ Y ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(20,plain,
( ( p @ sK2_Y )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[19]) ).
thf(21,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,20]) ).
thf(22,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[21,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN962+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.15 % Computer : n026.cluster.edu
% 0.10/0.15 % Model : x86_64 x86_64
% 0.10/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.15 % Memory : 8046.5625MB
% 0.10/0.15 % OS : Linux 6.8.0-71-generic
% 0.10/0.15 % CPULimit : 300
% 0.10/0.15 % WCLimit : 300
% 0.10/0.15 % DateTime : Tue Oct 6 17:33:17 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.19
% 0.10/0.19 No.of.Axioms: 0
% 0.10/0.19
% 0.10/0.19 Length.of.Defs: 0
% 0.10/0.19
% 0.10/0.19 Contains.Choice.Funs: false
% 0.10/0.19
% 0.10/0.19 ********************************
% 0.10/0.19 * All subproblems solved! *
% 0.10/0.19 ********************************
% 0.10/0.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.19
% 0.10/0.19 %**** Beginning of derivation protocol ****
% 0.10/0.19 % SZS output start CNFRefutation
% See solution above
% 0.10/0.19
% 0.10/0.19 %**** End of derivation protocol ****
% 0.10/0.19 %**** no. of clauses in derivation: 22 ****
% 0.10/0.19 %**** clause counter: 21 ****
% 0.10/0.19
% 0.10/0.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------