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