TSTP Solution File: LCL230-3 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LCL230-3 : TPTP v8.1.0. Released v2.3.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:21:53 EDT 2022
% Result : Unsatisfiable 27.63s 27.85s
% Output : CNFRefutation 27.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 67 ( 50 unt; 8 typ; 0 def)
% Number of atoms : 201 ( 63 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 404 ( 27 ~; 26 |; 0 &; 351 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 96 ( 0 ^ 96 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_axiom,type,
axiom: $i > $o ).
thf(tp_implies,type,
implies: $i > $i > $i ).
thf(tp_not,type,
not: $i > $i ).
thf(tp_or,type,
or: $i > $i > $i ).
thf(tp_p,type,
p: $i ).
thf(tp_q,type,
q: $i ).
thf(tp_r,type,
r: $i ).
thf(tp_theorem,type,
theorem: $i > $o ).
thf(1,axiom,
! [X: $i,Y: $i] :
( ( theorem @ X )
| ~ ( theorem @ ( implies @ Y @ X ) )
| ~ ( theorem @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
thf(2,axiom,
! [X: $i] :
( ( theorem @ X )
| ~ ( axiom @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
thf(3,axiom,
! [X: $i,Y: $i] :
( ( implies @ X @ Y )
= ( or @ ( not @ X ) @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] : ( axiom @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( or @ C @ A ) @ ( or @ C @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] : ( axiom @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
thf(6,axiom,
! [A: $i,B: $i] : ( axiom @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
thf(7,axiom,
! [A: $i,B: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
thf(8,axiom,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
thf(9,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(10,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[9]) ).
thf(11,negated_conjecture,
~ ( theorem @ ( implies @ ( implies @ ( or @ p @ q ) @ ( or @ p @ r ) ) @ ( or @ p @ ( implies @ q @ r ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(12,plain,
$false = $false,
inference(unfold_def,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [X: $i,Y: $i] :
( ( theorem @ X )
| ~ ( theorem @ ( implies @ Y @ X ) )
| ~ ( theorem @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(14,plain,
( ( ! [X: $i] :
( ( theorem @ X )
| ~ ( axiom @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(15,plain,
( ( ! [X: $i,Y: $i] :
( ( implies @ X @ Y )
= ( or @ ( not @ X ) @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(16,plain,
( ( ! [A: $i,B: $i,C: $i] : ( axiom @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( or @ C @ A ) @ ( or @ C @ B ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(17,plain,
( ( ! [A: $i,B: $i,C: $i] : ( axiom @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] : ( axiom @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(20,plain,
( ( ! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(21,plain,
( ( ~ ( theorem @ ( implies @ ( implies @ ( or @ p @ q ) @ ( or @ p @ r ) ) @ ( or @ p @ ( implies @ q @ r ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(22,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[12]) ).
thf(23,plain,
( ( ! [X: $i] :
( ( theorem @ X )
| ! [Y: $i] :
( ~ ( theorem @ ( implies @ Y @ X ) )
| ~ ( theorem @ Y ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(24,plain,
( ( ~ ( theorem @ ( implies @ ( implies @ ( or @ p @ q ) @ ( or @ p @ r ) ) @ ( or @ p @ ( implies @ q @ r ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(25,plain,
( ( ! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(26,plain,
( ( ! [A: $i,B: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(27,plain,
( ( ! [A: $i,B: $i] : ( axiom @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(28,plain,
( ( ! [A: $i,B: $i,C: $i] : ( axiom @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(29,plain,
( ( ! [A: $i,B: $i,C: $i] : ( axiom @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( or @ C @ A ) @ ( or @ C @ B ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(30,plain,
( ( ! [X: $i,Y: $i] :
( ( implies @ X @ Y )
= ( or @ ( not @ X ) @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(31,plain,
( ( ! [X: $i] :
( ( theorem @ X )
| ~ ( axiom @ X ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(32,plain,
( ( ! [X: $i] :
( ( theorem @ X )
| ! [Y: $i] :
( ~ ( theorem @ ( implies @ Y @ X ) )
| ~ ( theorem @ Y ) ) ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(33,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(34,plain,
( ( theorem @ ( implies @ ( implies @ ( or @ p @ q ) @ ( or @ p @ r ) ) @ ( or @ p @ ( implies @ q @ r ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(35,plain,
! [SV1: $i] :
( ( axiom @ ( implies @ ( or @ SV1 @ SV1 ) @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(36,plain,
! [SV2: $i] :
( ( ! [SY16: $i] : ( axiom @ ( implies @ SV2 @ ( or @ SY16 @ SV2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(37,plain,
! [SV3: $i] :
( ( ! [SY17: $i] : ( axiom @ ( implies @ ( or @ SV3 @ SY17 ) @ ( or @ SY17 @ SV3 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(38,plain,
! [SV4: $i] :
( ( ! [SY18: $i,SY19: $i] : ( axiom @ ( implies @ ( or @ SV4 @ ( or @ SY18 @ SY19 ) ) @ ( or @ SY18 @ ( or @ SV4 @ SY19 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(39,plain,
! [SV5: $i] :
( ( ! [SY20: $i,SY21: $i] : ( axiom @ ( implies @ ( implies @ SV5 @ SY20 ) @ ( implies @ ( or @ SY21 @ SV5 ) @ ( or @ SY21 @ SY20 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(40,plain,
! [SV6: $i] :
( ( ! [SY22: $i] :
( ( implies @ SV6 @ SY22 )
= ( or @ ( not @ SV6 ) @ SY22 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(41,plain,
! [SV7: $i] :
( ( ( theorem @ SV7 )
| ~ ( axiom @ SV7 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(42,plain,
! [SV8: $i] :
( ( ( theorem @ SV8 )
| ! [SY23: $i] :
( ~ ( theorem @ ( implies @ SY23 @ SV8 ) )
| ~ ( theorem @ SY23 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(43,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(44,plain,
! [SV9: $i,SV2: $i] :
( ( axiom @ ( implies @ SV2 @ ( or @ SV9 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[36]) ).
thf(45,plain,
! [SV10: $i,SV3: $i] :
( ( axiom @ ( implies @ ( or @ SV3 @ SV10 ) @ ( or @ SV10 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(46,plain,
! [SV11: $i,SV4: $i] :
( ( ! [SY24: $i] : ( axiom @ ( implies @ ( or @ SV4 @ ( or @ SV11 @ SY24 ) ) @ ( or @ SV11 @ ( or @ SV4 @ SY24 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(47,plain,
! [SV12: $i,SV5: $i] :
( ( ! [SY25: $i] : ( axiom @ ( implies @ ( implies @ SV5 @ SV12 ) @ ( implies @ ( or @ SY25 @ SV5 ) @ ( or @ SY25 @ SV12 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(48,plain,
! [SV13: $i,SV6: $i] :
( ( ( implies @ SV6 @ SV13 )
= ( or @ ( not @ SV6 ) @ SV13 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(49,plain,
! [SV7: $i] :
( ( ( theorem @ SV7 )
= $true )
| ( ( ~ ( axiom @ SV7 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[41]) ).
thf(50,plain,
! [SV8: $i] :
( ( ( theorem @ SV8 )
= $true )
| ( ( ! [SY23: $i] :
( ~ ( theorem @ ( implies @ SY23 @ SV8 ) )
| ~ ( theorem @ SY23 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[42]) ).
thf(51,plain,
! [SV14: $i,SV11: $i,SV4: $i] :
( ( axiom @ ( implies @ ( or @ SV4 @ ( or @ SV11 @ SV14 ) ) @ ( or @ SV11 @ ( or @ SV4 @ SV14 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(52,plain,
! [SV15: $i,SV12: $i,SV5: $i] :
( ( axiom @ ( implies @ ( implies @ SV5 @ SV12 ) @ ( implies @ ( or @ SV15 @ SV5 ) @ ( or @ SV15 @ SV12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(53,plain,
! [SV7: $i] :
( ( ( axiom @ SV7 )
= $false )
| ( ( theorem @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(54,plain,
! [SV8: $i,SV16: $i] :
( ( ( ~ ( theorem @ ( implies @ SV16 @ SV8 ) )
| ~ ( theorem @ SV16 ) )
= $true )
| ( ( theorem @ SV8 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[50]) ).
thf(55,plain,
! [SV8: $i,SV16: $i] :
( ( ( ~ ( theorem @ ( implies @ SV16 @ SV8 ) ) )
= $true )
| ( ( ~ ( theorem @ SV16 ) )
= $true )
| ( ( theorem @ SV8 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[54]) ).
thf(56,plain,
! [SV8: $i,SV16: $i] :
( ( ( theorem @ ( implies @ SV16 @ SV8 ) )
= $false )
| ( ( ~ ( theorem @ SV16 ) )
= $true )
| ( ( theorem @ SV8 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(57,plain,
! [SV8: $i,SV16: $i] :
( ( ( theorem @ SV16 )
= $false )
| ( ( theorem @ ( implies @ SV16 @ SV8 ) )
= $false )
| ( ( theorem @ SV8 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(58,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[34,57,53,52,51,48,45,44,43,35]) ).
thf(59,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL230-3 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n020.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 00:49:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35
% 0.19/0.35 No.of.Axioms: 9
% 0.19/0.35
% 0.19/0.35 Length.of.Defs: 0
% 0.19/0.35
% 0.19/0.35 Contains.Choice.Funs: false
% 0.19/0.35 (rf:0,axioms:9,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:11,loop_count:0,foatp_calls:0,translation:fof_full)...
% 27.63/27.85
% 27.63/27.85 ********************************
% 27.63/27.85 * All subproblems solved! *
% 27.63/27.85 ********************************
% 27.63/27.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:9,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:58,loop_count:0,foatp_calls:1,translation:fof_full)
% 27.63/27.85
% 27.63/27.85 %**** Beginning of derivation protocol ****
% 27.63/27.85 % SZS output start CNFRefutation
% See solution above
% 27.63/27.85
% 27.63/27.85 %**** End of derivation protocol ****
% 27.63/27.85 %**** no. of clauses in derivation: 59 ****
% 27.63/27.85 %**** clause counter: 58 ****
% 27.63/27.85
% 27.63/27.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:9,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:58,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------