TSTP Solution File: LCL065-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LCL065-1 : 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 : n011.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.86s 1.03s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 32 unt; 4 typ; 0 def)
% Number of atoms : 127 ( 36 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 254 ( 19 ~; 18 |; 0 &; 217 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 ^ 56 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_implies,type,
implies: $i > $i > $i ).
thf(tp_is_a_theorem,type,
is_a_theorem: $i > $o ).
thf(tp_not,type,
not: $i > $i ).
thf(1,axiom,
! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ X ) @ ( not @ Y ) ) @ ( implies @ Y @ X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
thf(2,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/sandbox2/benchmark/theBenchmark.p',cn_35) ).
thf(3,axiom,
! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ X @ ( implies @ Y @ X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
thf(4,axiom,
! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( implies @ X @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
thf(5,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(6,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[5]) ).
thf(7,negated_conjecture,
~ ( is_a_theorem @ ( implies @ ( implies @ ( not @ a ) @ a ) @ a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_2) ).
thf(8,plain,
$false = $false,
inference(unfold_def,[status(thm)],[6]) ).
thf(9,plain,
( ( ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ X ) @ ( not @ Y ) ) @ ( implies @ Y @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(10,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)],[2]) ).
thf(11,plain,
( ( ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ X @ ( implies @ Y @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(12,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)],[4]) ).
thf(13,plain,
( ( ~ ( is_a_theorem @ ( implies @ ( implies @ ( not @ a ) @ a ) @ a ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(14,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(15,plain,
( ( ~ ( is_a_theorem @ ( implies @ ( implies @ ( not @ a ) @ a ) @ a ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(16,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( implies @ X @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(17,plain,
( ( ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ X @ ( implies @ Y @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(18,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)],[10]) ).
thf(19,plain,
( ( ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ X ) @ ( not @ Y ) ) @ ( implies @ Y @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(20,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(21,plain,
( ( is_a_theorem @ ( implies @ ( implies @ ( not @ a ) @ a ) @ a ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(22,plain,
! [SV1: $i] :
( ( ! [SY9: $i] :
( ~ ( is_a_theorem @ ( implies @ SV1 @ SY9 ) )
| ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SY9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(23,plain,
! [SV2: $i] :
( ( ! [SY10: $i] : ( is_a_theorem @ ( implies @ SV2 @ ( implies @ SY10 @ SV2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(24,plain,
! [SV3: $i] :
( ( ! [SY11: $i,SY12: $i] : ( is_a_theorem @ ( implies @ ( implies @ SV3 @ ( implies @ SY11 @ SY12 ) ) @ ( implies @ ( implies @ SV3 @ SY11 ) @ ( implies @ SV3 @ SY12 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(25,plain,
! [SV4: $i] :
( ( ! [SY13: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ SV4 ) @ ( not @ SY13 ) ) @ ( implies @ SY13 @ SV4 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(26,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(27,plain,
! [SV5: $i,SV1: $i] :
( ( ~ ( is_a_theorem @ ( implies @ SV1 @ SV5 ) )
| ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(28,plain,
! [SV6: $i,SV2: $i] :
( ( is_a_theorem @ ( implies @ SV2 @ ( implies @ SV6 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(29,plain,
! [SV7: $i,SV3: $i] :
( ( ! [SY14: $i] : ( is_a_theorem @ ( implies @ ( implies @ SV3 @ ( implies @ SV7 @ SY14 ) ) @ ( implies @ ( implies @ SV3 @ SV7 ) @ ( implies @ SV3 @ SY14 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(30,plain,
! [SV8: $i,SV4: $i] :
( ( is_a_theorem @ ( implies @ ( implies @ ( not @ SV4 ) @ ( not @ SV8 ) ) @ ( implies @ SV8 @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(31,plain,
! [SV5: $i,SV1: $i] :
( ( ( ~ ( is_a_theorem @ ( implies @ SV1 @ SV5 ) ) )
= $true )
| ( ( ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[27]) ).
thf(32,plain,
! [SV9: $i,SV7: $i,SV3: $i] :
( ( is_a_theorem @ ( implies @ ( implies @ SV3 @ ( implies @ SV7 @ SV9 ) ) @ ( implies @ ( implies @ SV3 @ SV7 ) @ ( implies @ SV3 @ SV9 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(33,plain,
! [SV5: $i,SV1: $i] :
( ( ( is_a_theorem @ ( implies @ SV1 @ SV5 ) )
= $false )
| ( ( ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[31]) ).
thf(34,plain,
! [SV5: $i,SV1: $i] :
( ( ( ~ ( is_a_theorem @ SV1 ) )
= $true )
| ( ( is_a_theorem @ SV5 )
= $true )
| ( ( is_a_theorem @ ( implies @ SV1 @ SV5 ) )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(35,plain,
! [SV5: $i,SV1: $i] :
( ( ( is_a_theorem @ SV1 )
= $false )
| ( ( is_a_theorem @ SV5 )
= $true )
| ( ( is_a_theorem @ ( implies @ SV1 @ SV5 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(36,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[21,35,32,30,28,26]) ).
thf(37,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL065-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 00:10:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.36
% 0.21/0.36 No.of.Axioms: 5
% 0.21/0.36
% 0.21/0.36 Length.of.Defs: 0
% 0.21/0.36
% 0.21/0.36 Contains.Choice.Funs: false
% 0.21/0.36 (rf:0,axioms:5,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:7,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.86/1.03
% 0.86/1.03 ********************************
% 0.86/1.03 * All subproblems solved! *
% 0.86/1.03 ********************************
% 0.86/1.03 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:5,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:36,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.86/1.03
% 0.86/1.03 %**** Beginning of derivation protocol ****
% 0.86/1.03 % SZS output start CNFRefutation
% See solution above
% 0.86/1.03
% 0.86/1.03 %**** End of derivation protocol ****
% 0.86/1.03 %**** no. of clauses in derivation: 37 ****
% 0.86/1.03 %**** clause counter: 36 ****
% 0.86/1.03
% 0.86/1.03 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:5,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:36,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------