%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYO355^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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:08:06 AM UTC 2026
% Result : Theorem 0.11s 0.19s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 33 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 10 ( 3 ~; 0 |; 0 &; 4 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 ^; 25 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_sK1_Xf,type,
sK1_Xf: $i > $i ).
thf(tp_sK2_SY4,type,
sK2_SY4: $i > $i ).
thf(tp_sK3_SV3,type,
sK3_SV3: $i ).
thf(1,conjecture,
( ! [Xa: $i,Xb: $i] : ( Xa = Xb )
=> ! [Xf: $i > $i,Xg: $i > $i] : ( Xf = Xg ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM613) ).
thf(2,negated_conjecture,
( ( ! [Xa: $i,Xb: $i] : ( Xa = Xb )
=> ! [Xf: $i > $i,Xg: $i > $i] : ( Xf = Xg ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xa: $i,Xb: $i] : ( Xa = Xb )
=> ! [Xf: $i > $i,Xg: $i > $i] : ( Xf = Xg ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xa: $i,Xb: $i] : ( Xa = Xb ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xf: $i > $i,Xg: $i > $i] : ( Xf = Xg ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Xf: $i > $i,Xg: $i > $i] : ( Xf = Xg ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( sK1_Xf != sK2_SY4 )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [Xa: $i,Xb: $i] : ( Xa = Xb ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(9,plain,
( ( sK1_Xf != sK2_SY4 )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(10,plain,
! [SV1: $i] :
( ( ! [SY5: $i] : ( SV1 = SY5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[8]) ).
thf(11,plain,
( ( sK1_Xf = sK2_SY4 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(12,plain,
! [SV2: $i,SV1: $i] :
( ( SV1 = SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [SV3: $i] :
( ( sK1_Xf @ SV3 )
= ( sK2_SY4 @ SV3 ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[11]) ).
thf(14,plain,
( ( sK1_Xf = sK2_SY4 )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[11]) ).
thf(15,plain,
( ( ( sK1_Xf @ sK3_SV3 )
= ( sK2_SY4 @ sK3_SV3 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[13]) ).
thf(16,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,15,14]) ).
thf(17,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO355^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.16 % Computer : n009.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Oct 6 17:35:48 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.19
% 0.11/0.19 No.of.Axioms: 0
% 0.11/0.19
% 0.11/0.19 Length.of.Defs: 0
% 0.11/0.19
% 0.11/0.19 Contains.Choice.Funs: false
% 0.11/0.19
% 0.11/0.19 ********************************
% 0.11/0.19 * All subproblems solved! *
% 0.11/0.19 ********************************
% 0.11/0.19 % SZS status Theorem for /export/starexec/sandbox2/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:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:16,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 0.11/0.19
% 0.11/0.19 %**** Beginning of derivation protocol ****
% 0.11/0.19 % SZS output start CNFRefutation
% See solution above
% 0.11/0.19
% 0.11/0.19 %**** End of derivation protocol ****
% 0.11/0.19 %**** no. of clauses in derivation: 17 ****
% 0.11/0.19 %**** clause counter: 16 ****
% 0.11/0.19
% 0.11/0.19 % SZS status Theorem for /export/starexec/sandbox2/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:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:16,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------