%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYO350^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 : n015.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.07s 0.23s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 28 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 42 ( 2 ~; 0 |; 0 &; 34 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $i ).
thf(tp_g,type,
g: $i > $i ).
thf(tp_p,type,
p: ( $i > $i ) > $o ).
thf(tp_sK1_E,type,
sK1_E: $i ).
thf(1,conjecture,
( ! [X: $i] :
( ( f @ X )
= ( g @ X ) )
=> ( ( p @ f )
=> ( p @ g ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE1FUNC) ).
thf(2,negated_conjecture,
( ( ! [X: $i] :
( ( f @ X )
= ( g @ X ) )
=> ( ( p @ f )
=> ( p @ g ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: $i] :
( ( f @ X )
= ( g @ X ) )
=> ( ( p @ f )
=> ( p @ g ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] :
( ( f @ X )
= ( g @ X ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( p @ f )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( p @ g )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ( p @ g ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( p @ f )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(9,plain,
( ( ! [X: $i] :
( ( f @ X )
= ( g @ X ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(10,plain,
( ( ~ ( p @ g ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
! [SV1: $i] :
( ( ( f @ SV1 )
= ( g @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(12,plain,
( ( p @ g )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(13,plain,
! [SV2: $i] :
( ( ( f @ SV2 )
= ( g @ SV2 ) )
= $true ),
inference(rename,[status(thm)],[11]) ).
thf(15,plain,
( ( ( p @ g )
= ( p @ f ) )
= $false ),
inference(res,[status(thm)],[12,8]) ).
thf(16,plain,
( ( ( g @ sK1_E )
= ( f @ sK1_E ) )
= $false ),
inference(extuni,[status(esa)],[15]) ).
thf(17,plain,
! [SV2: $i] :
( ( ( ( g @ sK1_E )
= ( f @ sK1_E ) )
= ( ( f @ SV2 )
= ( g @ SV2 ) ) )
= $false ),
inference(res,[status(thm)],[16,13]) ).
thf(19,plain,
$false = $true,
inference(extuni,[status(esa)],[17:[bind(SV2,$thf( sK1_E ))]]) ).
thf(20,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO350^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % 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.07/0.19 % Computer : n015.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Oct 6 17:39:13 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 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.07/0.23
% 0.07/0.23 No.of.Axioms: 0
% 0.07/0.23
% 0.07/0.23 Length.of.Defs: 0
% 0.07/0.23
% 0.07/0.23 Contains.Choice.Funs: false
% 0.07/0.23
% 0.07/0.23 ********************************
% 0.07/0.23 * All subproblems solved! *
% 0.07/0.23 ********************************
% 0.07/0.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:19,loop_count:4,foatp_calls:1,translation:fof_experiment)
% 0.07/0.23
% 0.07/0.23 %**** Beginning of derivation protocol ****
% 0.07/0.23 % SZS output start CNFRefutation
% See solution above
% 0.07/0.23
% 0.07/0.23 %**** End of derivation protocol ****
% 0.07/0.23 %**** no. of clauses in derivation: 18 ****
% 0.07/0.23 %**** clause counter: 19 ****
% 0.07/0.23
% 0.07/0.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:19,loop_count:4,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------