TSTP Solution File: SYO285^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO285^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 : n009.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:10 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 16 unt; 4 typ; 0 def)
% Number of atoms : 46 ( 15 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 29 ( 2 ~; 0 |; 4 &; 20 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cQ,type,
cQ: $i > $o ).
thf(tp_cR,type,
cR: $i > $o ).
thf(tp_sK1_Xx,type,
sK1_Xx: $i ).
thf(tp_y,type,
y: $i ).
thf(1,conjecture,
( ! [Xp: $i > $o] : ( Xp @ y )
=> ( ! [Xx: $i] : ( cR @ Xx )
& ( cQ @ y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTEST2) ).
thf(2,negated_conjecture,
( ( ! [Xp: $i > $o] : ( Xp @ y )
=> ( ! [Xx: $i] : ( cR @ Xx )
& ( cQ @ y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y )
=> ( ! [Xx: $i] : ( cR @ Xx )
& ( 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,
( ( ! [Xx: $i] : ( cR @ Xx )
& ( cQ @ y ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( cQ @ y )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(9,plain,
( ( ~ ( cQ @ y ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(11,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(13,plain,
! [SV1: $i > $o] :
( ( SV1 @ y )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(16,plain,
$false = $true,
inference(prim_subst,[status(thm)],[13:[bind(SV1,$thf( ^ [SV4: $i] : $false ))]]) ).
thf(21,plain,
$false = $true,
inference(sim,[status(thm)],[16]) ).
thf(22,plain,
( ( ! [Xp: $i > $o] : ( Xp @ y ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(23,plain,
( ( ~ ( cQ @ y ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(24,plain,
! [SV8: $i > $o] :
( ( SV8 @ y )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(25,plain,
( ( cQ @ y )
= $false ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[24,25]) ).
thf(27,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[26,21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO285^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n009.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 : Fri Jul 8 23:18:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (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.19/0.38 ********************************
% 0.19/0.38 * All subproblems solved! *
% 0.19/0.38 ********************************
% 0.19/0.38 % 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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.38
% 0.19/0.38 %**** Beginning of derivation protocol ****
% 0.19/0.38 % SZS output start CNFRefutation
% See solution above
% 0.19/0.38
% 0.19/0.38 %**** End of derivation protocol ****
% 0.19/0.38 %**** no. of clauses in derivation: 17 ****
% 0.19/0.38 %**** clause counter: 26 ****
% 0.19/0.38
% 0.19/0.38 % 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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:26,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------