%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SEV430^1 : TPTP v9.3.1. Released v5.2.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 : n004.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 10:50:05 AM UTC 2026
% Result : Theorem 0.10s 0.18s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 25 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 36 ( 4 ~; 0 |; 0 &; 32 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 13 !; 6 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $i ).
thf(tp_sK1_X,type,
sK1_X: ( $i > $i ) > $i ).
thf(tp_sK2_X,type,
sK2_X: $i > $i ).
thf(1,axiom,
! [Y: $i] :
? [X: $i] :
( ( f @ X )
= Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj) ).
thf(2,conjecture,
? [G: $i > $i] :
! [X: $i] :
( ( f @ ( G @ X ) )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',invexists) ).
thf(3,negated_conjecture,
( ( ? [G: $i > $i] :
! [X: $i] :
( ( f @ ( G @ X ) )
= X ) )
= $false ),
inference(negate_conjecture,[status(cth)],[2]) ).
thf(4,plain,
( ( ? [G: $i > $i] :
! [X: $i] :
( ( f @ ( G @ X ) )
= X ) )
= $false ),
inference(unfold_def,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Y: $i] :
? [X: $i] :
( ( f @ X )
= Y ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(6,plain,
( ( ~ ? [G: $i > $i] :
! [X: $i] :
( ( f @ ( G @ X ) )
= X ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ! [G: $i > $i] :
( ( f @ ( G @ ( sK1_X @ G ) ) )
!= ( sK1_X @ G ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [Y: $i] :
( ( f @ ( sK2_X @ Y ) )
= Y ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(9,plain,
( ( ! [Y: $i] :
( ( f @ ( sK2_X @ Y ) )
= Y ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [G: $i > $i] :
( ( f @ ( G @ ( sK1_X @ G ) ) )
!= ( sK1_X @ G ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
! [SV1: $i] :
( ( ( f @ ( sK2_X @ SV1 ) )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(12,plain,
! [SV2: $i > $i] :
( ( ( f @ ( SV2 @ ( sK1_X @ SV2 ) ) )
!= ( sK1_X @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
! [SV2: $i > $i] :
( ( ( f @ ( SV2 @ ( sK1_X @ SV2 ) ) )
= ( sK1_X @ SV2 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(14,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[11,13]) ).
thf(15,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV430^1 : TPTP v9.3.1. Released v5.2.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.16 % Computer : n004.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Oct 6 15:46:24 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.18
% 0.10/0.18 No.of.Axioms: 1
% 0.10/0.18
% 0.10/0.18 Length.of.Defs: 0
% 0.10/0.18
% 0.10/0.18 Contains.Choice.Funs: false
% 0.10/0.18
% 0.10/0.18 ********************************
% 0.10/0.18 * All subproblems solved! *
% 0.10/0.18 ********************************
% 0.10/0.18 % 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:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.18
% 0.10/0.18 %**** Beginning of derivation protocol ****
% 0.10/0.18 % SZS output start CNFRefutation
% See solution above
% 0.10/0.18
% 0.10/0.18 %**** End of derivation protocol ****
% 0.10/0.18 %**** no. of clauses in derivation: 15 ****
% 0.10/0.18 %**** clause counter: 14 ****
% 0.10/0.18
% 0.10/0.18 % 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:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------