TSTP Solution File: SYO291^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO291^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 17:33:12 EDT 2022
% Result : Theorem 0.18s 0.39s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 60 ( 19 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 43 ( 2 ~; 0 |; 8 &; 30 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cQ,type,
cQ: $i > $o ).
thf(tp_cR,type,
cR: $i > $o ).
thf(tp_f,type,
f: $i > $i ).
thf(tp_x,type,
x: $i ).
thf(tp_y,type,
y: $i ).
thf(1,conjecture,
( ! [Xp: $i > $o] : ( Xp @ y )
=> ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTEST3) ).
thf(2,negated_conjecture,
( ( ! [Xp: $i > $o] : ( Xp @ y )
=> ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y )
=> ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( cQ @ y )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(11,plain,
( ( ~ ( cQ @ y ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(12,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(14,plain,
! [SV1: $i > $o] :
( ( SV1 @ y )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(17,plain,
$false = $true,
inference(prim_subst,[status(thm)],[14:[bind(SV1,$thf( ^ [SV4: $i] : $false ))]]) ).
thf(22,plain,
$false = $true,
inference(sim,[status(thm)],[17]) ).
thf(23,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(25,plain,
! [SV8: $i > $o] :
( ( SV8 @ y )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(28,plain,
$false = $true,
inference(prim_subst,[status(thm)],[25:[bind(SV8,$thf( ^ [SV11: $i] : $false ))]]) ).
thf(33,plain,
$false = $true,
inference(sim,[status(thm)],[28]) ).
thf(34,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(35,plain,
( ( ~ ( cQ @ y ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(36,plain,
! [SV15: $i > $o] :
( ( SV15 @ y )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(37,plain,
( ( cQ @ y )
= $false ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(38,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[36,37]) ).
thf(39,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[38,22,33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYO291^5 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 06:07:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.33
% 0.12/0.33 No.of.Axioms: 0
% 0.12/0.33
% 0.12/0.33 Length.of.Defs: 0
% 0.12/0.33
% 0.12/0.33 Contains.Choice.Funs: false
% 0.12/0.33 (rf:0,axioms:0,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.18/0.39 ********************************
% 0.18/0.39 * All subproblems solved! *
% 0.18/0.39 ********************************
% 0.18/0.39 % 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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:38,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.39
% 0.18/0.39 %**** Beginning of derivation protocol ****
% 0.18/0.39 % SZS output start CNFRefutation
% See solution above
% 0.18/0.39
% 0.18/0.39 %**** End of derivation protocol ****
% 0.18/0.39 %**** no. of clauses in derivation: 21 ****
% 0.18/0.39 %**** clause counter: 38 ****
% 0.18/0.39
% 0.18/0.39 % 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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:38,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------