TSTP Solution File: LCL064-2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LCL064-2 : TPTP v8.1.0. Released v1.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 : Sun Jul 17 12:20:18 EDT 2022
% Result : Unsatisfiable 0.46s 0.63s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 27 unt; 5 typ; 0 def)
% Number of atoms : 114 ( 32 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 229 ( 19 ~; 18 |; 0 &; 192 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 46 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_implies,type,
implies: $i > $i > $i ).
thf(tp_is_a_theorem,type,
is_a_theorem: $i > $o ).
thf(1,axiom,
! [X: $i,Y: $i,Z: $i] : ( is_a_theorem @ ( implies @ ( implies @ X @ ( implies @ Y @ Z ) ) @ ( implies @ ( implies @ X @ Y ) @ ( implies @ X @ Z ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
thf(2,axiom,
! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ X @ ( implies @ Y @ X ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
thf(3,axiom,
! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( implies @ X @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
thf(4,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(5,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,negated_conjecture,
~ ( is_a_theorem @ ( implies @ ( implies @ a @ b ) @ ( implies @ ( implies @ b @ c ) @ ( implies @ a @ c ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).
thf(7,plain,
$false = $false,
inference(unfold_def,[status(thm)],[5]) ).
thf(8,plain,
( ( ! [X: $i,Y: $i,Z: $i] : ( is_a_theorem @ ( implies @ ( implies @ X @ ( implies @ Y @ Z ) ) @ ( implies @ ( implies @ X @ Y ) @ ( implies @ X @ Z ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(9,plain,
( ( ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ X @ ( implies @ Y @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(10,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( implies @ X @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(11,plain,
( ( ~ ( is_a_theorem @ ( implies @ ( implies @ a @ b ) @ ( implies @ ( implies @ b @ c ) @ ( implies @ a @ c ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(13,plain,
( ( ~ ( is_a_theorem @ ( implies @ ( implies @ a @ b ) @ ( implies @ ( implies @ b @ c ) @ ( implies @ a @ c ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(14,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( implies @ X @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(15,plain,
( ( ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ X @ ( implies @ Y @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(16,plain,
( ( ! [X: $i,Y: $i,Z: $i] : ( is_a_theorem @ ( implies @ ( implies @ X @ ( implies @ Y @ Z ) ) @ ( implies @ ( implies @ X @ Y ) @ ( implies @ X @ Z ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(17,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(18,plain,
( ( is_a_theorem @ ( implies @ ( implies @ a @ b ) @ ( implies @ ( implies @ b @ c ) @ ( implies @ a @ c ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(19,plain,
! [SV1: $i] :
( ( ! [SY7: $i] :
( ~ ( is_a_theorem @ ( implies @ SV1 @ SY7 ) )
| ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SY7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(20,plain,
! [SV2: $i] :
( ( ! [SY8: $i] : ( is_a_theorem @ ( implies @ SV2 @ ( implies @ SY8 @ SV2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(21,plain,
! [SV3: $i] :
( ( ! [SY9: $i,SY10: $i] : ( is_a_theorem @ ( implies @ ( implies @ SV3 @ ( implies @ SY9 @ SY10 ) ) @ ( implies @ ( implies @ SV3 @ SY9 ) @ ( implies @ SV3 @ SY10 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(22,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(23,plain,
! [SV4: $i,SV1: $i] :
( ( ~ ( is_a_theorem @ ( implies @ SV1 @ SV4 ) )
| ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(24,plain,
! [SV5: $i,SV2: $i] :
( ( is_a_theorem @ ( implies @ SV2 @ ( implies @ SV5 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV6: $i,SV3: $i] :
( ( ! [SY11: $i] : ( is_a_theorem @ ( implies @ ( implies @ SV3 @ ( implies @ SV6 @ SY11 ) ) @ ( implies @ ( implies @ SV3 @ SV6 ) @ ( implies @ SV3 @ SY11 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(26,plain,
! [SV4: $i,SV1: $i] :
( ( ( ~ ( is_a_theorem @ ( implies @ SV1 @ SV4 ) ) )
= $true )
| ( ( ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV4 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[23]) ).
thf(27,plain,
! [SV7: $i,SV6: $i,SV3: $i] :
( ( is_a_theorem @ ( implies @ ( implies @ SV3 @ ( implies @ SV6 @ SV7 ) ) @ ( implies @ ( implies @ SV3 @ SV6 ) @ ( implies @ SV3 @ SV7 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(28,plain,
! [SV4: $i,SV1: $i] :
( ( ( is_a_theorem @ ( implies @ SV1 @ SV4 ) )
= $false )
| ( ( ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV4 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(29,plain,
! [SV4: $i,SV1: $i] :
( ( ( ~ ( is_a_theorem @ SV1 ) )
= $true )
| ( ( is_a_theorem @ SV4 )
= $true )
| ( ( is_a_theorem @ ( implies @ SV1 @ SV4 ) )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[28]) ).
thf(30,plain,
! [SV4: $i,SV1: $i] :
( ( ( is_a_theorem @ SV1 )
= $false )
| ( ( is_a_theorem @ SV4 )
= $true )
| ( ( is_a_theorem @ ( implies @ SV1 @ SV4 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[29]) ).
thf(31,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,30,27,24,22]) ).
thf(32,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL064-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 18:39:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 4
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:4,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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:6,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.46/0.63
% 0.46/0.63 ********************************
% 0.46/0.63 * All subproblems solved! *
% 0.46/0.63 ********************************
% 0.46/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:4,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.46/0.63
% 0.46/0.63 %**** Beginning of derivation protocol ****
% 0.46/0.63 % SZS output start CNFRefutation
% See solution above
% 0.46/0.63
% 0.46/0.63 %**** End of derivation protocol ****
% 0.46/0.63 %**** no. of clauses in derivation: 32 ****
% 0.46/0.63 %**** clause counter: 31 ****
% 0.46/0.63
% 0.46/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:4,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:31,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------