TSTP Solution File: LCL497+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL497+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : 300s
% DateTime : Fri May 3 02:38:02 EDT 2024
% Result : Theorem 38.12s 6.18s
% Output : CNFRefutation 38.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 104 ( 45 unt; 0 def)
% Number of atoms : 182 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 136 ( 58 ~; 52 |; 2 &)
% ( 13 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 147 ( 3 sgn 77 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn2) ).
fof(f22,axiom,
( r1
<=> ! [X3] : is_a_theorem(implies(or(X3,X3),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r1) ).
fof(f23,axiom,
( r2
<=> ! [X3,X4] : is_a_theorem(implies(X4,or(X3,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f24,axiom,
( r3
<=> ! [X3,X4] : is_a_theorem(implies(or(X3,X4),or(X4,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f25,axiom,
( r4
<=> ! [X3,X4,X5] : is_a_theorem(implies(or(X3,or(X4,X5)),or(X4,or(X3,X5)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r4) ).
fof(f26,axiom,
( r5
<=> ! [X3,X4,X5] : is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r5) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f36,axiom,
r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r1) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(f45,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(f46,negated_conjecture,
~ cn2,
inference(negated_conjecture,[],[f45]) ).
fof(f51,plain,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(rectify,[],[f20]) ).
fof(f53,plain,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(rectify,[],[f22]) ).
fof(f54,plain,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(rectify,[],[f23]) ).
fof(f55,plain,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(rectify,[],[f24]) ).
fof(f56,plain,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(rectify,[],[f25]) ).
fof(f57,plain,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(rectify,[],[f26]) ).
fof(f58,plain,
~ cn2,
inference(flattening,[],[f46]) ).
fof(f59,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f60,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f56]) ).
fof(f61,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f62,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f54]) ).
fof(f63,plain,
( r1
=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f64,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f51]) ).
fof(f66,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f69,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f66]) ).
fof(f70,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f69]) ).
fof(f72,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f64]) ).
fof(f73,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(ennf_transformation,[],[f63]) ).
fof(f74,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f62]) ).
fof(f75,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f61]) ).
fof(f76,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f60]) ).
fof(f77,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f59]) ).
fof(f80,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f82,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
=> ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(choice_axiom,[]) ).
fof(f83,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f72,f82]) ).
fof(f84,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f70]) ).
fof(f86,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f83]) ).
fof(f87,plain,
! [X0] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f88,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f74]) ).
fof(f89,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f75]) ).
fof(f90,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f76]) ).
fof(f91,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f77]) ).
fof(f94,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f80]) ).
fof(f96,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f99,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f100,plain,
r1,
inference(cnf_transformation,[],[f36]) ).
fof(f101,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f102,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f103,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f104,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f108,plain,
~ cn2,
inference(cnf_transformation,[],[f58]) ).
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f84]) ).
cnf(c_51,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_52,plain,
( ~ r1
| is_a_theorem(implies(or(X0,X0),X0)) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_53,plain,
( ~ r2
| is_a_theorem(implies(X0,or(X1,X0))) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_54,plain,
( ~ r3
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_55,plain,
( ~ r4
| is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(cnf_transformation,[],[f90]) ).
cnf(c_56,plain,
( ~ r5
| is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_59,plain,
( ~ op_implies_or
| or(not(X0),X1) = implies(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_61,plain,
op_implies_or,
inference(cnf_transformation,[],[f96]) ).
cnf(c_64,plain,
modus_ponens,
inference(cnf_transformation,[],[f99]) ).
cnf(c_65,plain,
r1,
inference(cnf_transformation,[],[f100]) ).
cnf(c_66,plain,
r2,
inference(cnf_transformation,[],[f101]) ).
cnf(c_67,plain,
r3,
inference(cnf_transformation,[],[f102]) ).
cnf(c_68,plain,
r4,
inference(cnf_transformation,[],[f103]) ).
cnf(c_69,plain,
r5,
inference(cnf_transformation,[],[f104]) ).
cnf(c_73,negated_conjecture,
~ cn2,
inference(cnf_transformation,[],[f108]) ).
cnf(c_84,plain,
is_a_theorem(implies(X0,or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_53,c_66,c_53]) ).
cnf(c_87,plain,
is_a_theorem(implies(or(X0,X0),X0)),
inference(global_subsumption_just,[status(thm)],[c_52,c_65,c_52]) ).
cnf(c_92,plain,
is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_54,c_67,c_54]) ).
cnf(c_95,plain,
or(not(X0),X1) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_59,c_61,c_59]) ).
cnf(c_101,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_64,c_49]) ).
cnf(c_102,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_101]) ).
cnf(c_112,plain,
is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(global_subsumption_just,[status(thm)],[c_56,c_69,c_56]) ).
cnf(c_115,plain,
is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(global_subsumption_just,[status(thm)],[c_55,c_68,c_55]) ).
cnf(c_510,plain,
is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_95,c_92]) ).
cnf(c_716,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))),
inference(superposition,[status(thm)],[c_95,c_112]) ).
cnf(c_736,plain,
is_a_theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_95,c_510]) ).
cnf(c_1527,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_95,c_716]) ).
cnf(c_1645,plain,
( ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_736,c_102]) ).
cnf(c_1779,plain,
is_a_theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_95,c_115]) ).
cnf(c_1926,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X2,X0),implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_1527,c_102]) ).
cnf(c_2255,plain,
is_a_theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_95,c_1779]) ).
cnf(c_2916,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_1926,c_102]) ).
cnf(c_3915,plain,
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_2255,c_102]) ).
cnf(c_6512,plain,
( ~ is_a_theorem(implies(X0,implies(not(sK0),sK1)))
| ~ is_a_theorem(implies(sK0,X0))
| is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(instantiation,[status(thm)],[c_2916]) ).
cnf(c_6839,plain,
( ~ is_a_theorem(implies(or(sK1,not(not(sK0))),implies(not(sK0),sK1)))
| ~ is_a_theorem(implies(sK0,or(sK1,not(not(sK0)))))
| is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(instantiation,[status(thm)],[c_6512]) ).
cnf(c_9606,plain,
is_a_theorem(implies(or(sK1,not(not(sK0))),implies(not(sK0),sK1))),
inference(instantiation,[status(thm)],[c_510]) ).
cnf(c_10656,plain,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_87,c_102]) ).
cnf(c_12659,plain,
is_a_theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_84,c_3915]) ).
cnf(c_12862,plain,
is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_12659,c_10656]) ).
cnf(c_12951,plain,
is_a_theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_12862,c_1645]) ).
cnf(c_12956,plain,
is_a_theorem(implies(sK0,not(not(sK0)))),
inference(instantiation,[status(thm)],[c_12951]) ).
cnf(c_14287,plain,
( ~ is_a_theorem(implies(X0,or(sK1,not(not(sK0)))))
| ~ is_a_theorem(implies(sK0,X0))
| is_a_theorem(implies(sK0,or(sK1,not(not(sK0))))) ),
inference(instantiation,[status(thm)],[c_2916]) ).
cnf(c_15379,plain,
( ~ is_a_theorem(implies(not(not(sK0)),or(sK1,not(not(sK0)))))
| ~ is_a_theorem(implies(sK0,not(not(sK0))))
| is_a_theorem(implies(sK0,or(sK1,not(not(sK0))))) ),
inference(instantiation,[status(thm)],[c_14287]) ).
cnf(c_22503,plain,
is_a_theorem(implies(not(not(sK0)),or(sK1,not(not(sK0))))),
inference(instantiation,[status(thm)],[c_84]) ).
cnf(c_22504,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_22503,c_15379,c_12956,c_9606,c_6839,c_51,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL497+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n012.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 18:48:55 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 38.12/6.18 % SZS status Started for theBenchmark.p
% 38.12/6.18 % SZS status Theorem for theBenchmark.p
% 38.12/6.18
% 38.12/6.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 38.12/6.18
% 38.12/6.18 ------ iProver source info
% 38.12/6.18
% 38.12/6.18 git: date: 2024-05-02 19:28:25 +0000
% 38.12/6.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 38.12/6.18 git: non_committed_changes: false
% 38.12/6.18
% 38.12/6.18 ------ Parsing...
% 38.12/6.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 38.12/6.18
% 38.12/6.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 13 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 38.12/6.18
% 38.12/6.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 38.12/6.18
% 38.12/6.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 38.12/6.18 ------ Proving...
% 38.12/6.18 ------ Problem Properties
% 38.12/6.18
% 38.12/6.18
% 38.12/6.18 clauses 12
% 38.12/6.18 conjectures 0
% 38.12/6.18 EPR 0
% 38.12/6.18 Horn 12
% 38.12/6.18 unary 10
% 38.12/6.18 binary 1
% 38.12/6.18 lits 15
% 38.12/6.18 lits eq 5
% 38.12/6.18 fd_pure 0
% 38.12/6.18 fd_pseudo 0
% 38.12/6.18 fd_cond 0
% 38.12/6.18 fd_pseudo_cond 1
% 38.12/6.18 AC symbols 0
% 38.12/6.18
% 38.12/6.18 ------ Input Options Time Limit: Unbounded
% 38.12/6.18
% 38.12/6.18
% 38.12/6.18 ------
% 38.12/6.18 Current options:
% 38.12/6.18 ------
% 38.12/6.18
% 38.12/6.18
% 38.12/6.18
% 38.12/6.18
% 38.12/6.18 ------ Proving...
% 38.12/6.18
% 38.12/6.18
% 38.12/6.18 % SZS status Theorem for theBenchmark.p
% 38.12/6.18
% 38.12/6.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 38.12/6.18
% 38.12/6.18
%------------------------------------------------------------------------------