TSTP Solution File: LCL458+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL458+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Thu Aug 31 07:44:36 EDT 2023
% Result : Theorem 94.79s 13.75s
% Output : CNFRefutation 94.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 23
% Syntax : Number of formulae : 138 ( 77 unt; 0 def)
% Number of atoms : 220 ( 52 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 148 ( 66 ~; 57 |; 2 &)
% ( 7 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 210 ( 0 sgn; 85 !; 6 ?)
% 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(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_tollens) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_3) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).
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(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
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(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_equiv) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_3) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f50,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f51,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f52,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_equiv) ).
fof(f53,conjecture,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(f54,negated_conjecture,
~ r5,
inference(negated_conjecture,[],[f53]) ).
fof(f65,plain,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(rectify,[],[f26]) ).
fof(f66,plain,
~ r5,
inference(flattening,[],[f54]) ).
fof(f67,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
=> r5 ),
inference(unused_predicate_definition_removal,[],[f65]) ).
fof(f74,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f77,plain,
( implies_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f80,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f81,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f82,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(f83,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f82]) ).
fof(f84,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f81]) ).
fof(f86,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f80]) ).
fof(f89,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f77]) ).
fof(f92,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f74]) ).
fof(f99,plain,
( r5
| ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f100,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f101,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f102,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f103,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f104,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f105,plain,
( ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
=> ~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
( r5
| ~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f99,f105]) ).
fof(f107,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f84]) ).
fof(f108,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f85]) ).
fof(f109,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f86]) ).
fof(f112,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f89]) ).
fof(f115,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f92]) ).
fof(f122,plain,
( r5
| ~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))) ),
inference(cnf_transformation,[],[f106]) ).
fof(f123,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f100]) ).
fof(f124,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f101]) ).
fof(f125,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f102]) ).
fof(f126,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f103]) ).
fof(f127,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f104]) ).
fof(f128,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f129,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f131,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f132,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f135,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f138,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f145,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f146,plain,
op_implies_or,
inference(cnf_transformation,[],[f50]) ).
fof(f147,plain,
op_and,
inference(cnf_transformation,[],[f51]) ).
fof(f148,plain,
op_equiv,
inference(cnf_transformation,[],[f52]) ).
fof(f149,plain,
~ r5,
inference(cnf_transformation,[],[f66]) ).
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f107]) ).
cnf(c_50,plain,
( ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents
| X0 = X1 ),
inference(cnf_transformation,[],[f108]) ).
cnf(c_51,plain,
( ~ modus_tollens
| is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))) ),
inference(cnf_transformation,[],[f109]) ).
cnf(c_54,plain,
( ~ implies_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_57,plain,
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f115]) ).
cnf(c_64,plain,
( ~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2))))
| r5 ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_65,plain,
( ~ op_or
| not(and(not(X0),not(X1))) = or(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_66,plain,
( ~ op_and
| not(or(not(X0),not(X1))) = and(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_67,plain,
( ~ op_implies_and
| not(and(X0,not(X1))) = implies(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_68,plain,
( ~ op_implies_or
| or(not(X0),X1) = implies(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_69,plain,
( ~ op_equiv
| and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
cnf(c_70,plain,
op_or,
inference(cnf_transformation,[],[f128]) ).
cnf(c_71,plain,
op_implies_and,
inference(cnf_transformation,[],[f129]) ).
cnf(c_73,plain,
modus_ponens,
inference(cnf_transformation,[],[f131]) ).
cnf(c_74,plain,
modus_tollens,
inference(cnf_transformation,[],[f132]) ).
cnf(c_77,plain,
implies_3,
inference(cnf_transformation,[],[f135]) ).
cnf(c_80,plain,
and_3,
inference(cnf_transformation,[],[f138]) ).
cnf(c_87,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f145]) ).
cnf(c_88,plain,
op_implies_or,
inference(cnf_transformation,[],[f146]) ).
cnf(c_89,plain,
op_and,
inference(cnf_transformation,[],[f147]) ).
cnf(c_90,plain,
op_equiv,
inference(cnf_transformation,[],[f148]) ).
cnf(c_91,negated_conjecture,
~ r5,
inference(cnf_transformation,[],[f149]) ).
cnf(c_129,plain,
is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(global_subsumption_just,[status(thm)],[c_57,c_80,c_57]) ).
cnf(c_132,plain,
or(not(X0),X1) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_68,c_88,c_68]) ).
cnf(c_135,plain,
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(global_subsumption_just,[status(thm)],[c_50,c_87,c_50]) ).
cnf(c_138,plain,
not(and(X0,not(X1))) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_67,c_71,c_67]) ).
cnf(c_144,plain,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_51,c_74,c_51]) ).
cnf(c_147,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_73,c_49]) ).
cnf(c_148,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_147]) ).
cnf(c_149,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_66,c_89,c_66]) ).
cnf(c_152,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_65,c_70,c_65]) ).
cnf(c_155,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_69,c_90,c_69]) ).
cnf(c_158,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))),
inference(global_subsumption_just,[status(thm)],[c_64,c_91,c_64]) ).
cnf(c_163,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(global_subsumption_just,[status(thm)],[c_54,c_77,c_54]) ).
cnf(c_267,plain,
implies(not(X0),X1) = or(X0,X1),
inference(demodulation,[status(thm)],[c_152,c_138]) ).
cnf(c_268,plain,
is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(demodulation,[status(thm)],[c_144,c_267]) ).
cnf(c_269,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_149,c_132]) ).
cnf(c_199157,plain,
or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[status(thm)],[c_138,c_267]) ).
cnf(c_202614,plain,
is_a_theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_132,c_268]) ).
cnf(c_202643,plain,
is_a_theorem(implies(implies(X0,not(not(X1))),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c_267,c_202614]) ).
cnf(c_202749,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_269,c_132]) ).
cnf(c_202863,plain,
is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(demodulation,[status(thm)],[c_202643,c_199157,c_202749]) ).
cnf(c_204010,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,and(X0,X1))) ),
inference(superposition,[status(thm)],[c_129,c_148]) ).
cnf(c_205112,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(and(X0,X1)) ),
inference(superposition,[status(thm)],[c_204010,c_148]) ).
cnf(c_222165,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(equiv(X0,X1)) ),
inference(superposition,[status(thm)],[c_155,c_205112]) ).
cnf(c_243106,plain,
( ~ is_a_theorem(implies(implies(X0,X1),or(X1,not(X0))))
| is_a_theorem(equiv(implies(X0,X1),or(X1,not(X0)))) ),
inference(superposition,[status(thm)],[c_268,c_222165]) ).
cnf(c_243234,plain,
is_a_theorem(equiv(implies(X0,X1),or(X1,not(X0)))),
inference(forward_subsumption_resolution,[status(thm)],[c_243106,c_202863]) ).
cnf(c_252003,plain,
or(X0,not(X1)) = implies(X1,X0),
inference(superposition,[status(thm)],[c_243234,c_135]) ).
cnf(c_270459,plain,
implies(X0,not(X1)) = implies(X1,not(X0)),
inference(superposition,[status(thm)],[c_132,c_252003]) ).
cnf(c_270546,plain,
not(or(X0,not(X1))) = and(not(X0),X1),
inference(superposition,[status(thm)],[c_267,c_269]) ).
cnf(c_270562,plain,
not(implies(X0,X1)) = and(not(X1),X0),
inference(light_normalisation,[status(thm)],[c_270546,c_252003]) ).
cnf(c_270634,plain,
is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X2),or(X0,X2)))),
inference(superposition,[status(thm)],[c_267,c_163]) ).
cnf(c_270635,plain,
is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X0,X2)))),
inference(light_normalisation,[status(thm)],[c_270634,c_267]) ).
cnf(c_270994,plain,
implies(X0,not(not(X1))) = or(X1,not(X0)),
inference(superposition,[status(thm)],[c_270459,c_267]) ).
cnf(c_270995,plain,
not(implies(X0,not(X1))) = and(X1,X0),
inference(superposition,[status(thm)],[c_270459,c_269]) ).
cnf(c_271330,plain,
not(or(X0,not(X1))) = and(X1,not(X0)),
inference(superposition,[status(thm)],[c_267,c_270995]) ).
cnf(c_271377,plain,
not(implies(X0,X1)) = and(X0,not(X1)),
inference(light_normalisation,[status(thm)],[c_271330,c_252003]) ).
cnf(c_271391,plain,
not(not(implies(X0,X1))) = implies(X0,X1),
inference(demodulation,[status(thm)],[c_138,c_271377]) ).
cnf(c_271520,plain,
not(implies(not(X0),X1)) = not(implies(not(X1),X0)),
inference(superposition,[status(thm)],[c_271377,c_270562]) ).
cnf(c_271521,plain,
not(implies(not(X0),X1)) = not(or(X1,X0)),
inference(light_normalisation,[status(thm)],[c_271520,c_267]) ).
cnf(c_271522,plain,
not(or(X0,X1)) = not(or(X1,X0)),
inference(light_normalisation,[status(thm)],[c_271521,c_267]) ).
cnf(c_271528,plain,
not(not(or(X0,X1))) = or(X0,X1),
inference(superposition,[status(thm)],[c_267,c_271391]) ).
cnf(c_272088,plain,
not(not(or(X0,X1))) = or(X1,X0),
inference(superposition,[status(thm)],[c_271522,c_271528]) ).
cnf(c_272609,plain,
implies(X0,not(not(X1))) = implies(X0,X1),
inference(demodulation,[status(thm)],[c_270994,c_252003]) ).
cnf(c_272891,plain,
implies(X0,or(X1,X2)) = implies(X0,or(X2,X1)),
inference(superposition,[status(thm)],[c_272088,c_272609]) ).
cnf(c_272897,plain,
or(X0,X1) = or(X1,X0),
inference(superposition,[status(thm)],[c_272088,c_271528]) ).
cnf(c_272925,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK1,sK0),or(sK0,sK2)))),
inference(demodulation,[status(thm)],[c_158,c_272897]) ).
cnf(c_274691,plain,
is_a_theorem(implies(or(X0,not(X1)),implies(or(X1,X2),or(X0,X2)))),
inference(superposition,[status(thm)],[c_267,c_270635]) ).
cnf(c_274705,plain,
is_a_theorem(implies(implies(X0,X1),implies(or(X0,X2),or(X1,X2)))),
inference(light_normalisation,[status(thm)],[c_274691,c_252003]) ).
cnf(c_277323,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK1,sK0),or(sK2,sK0)))),
inference(demodulation,[status(thm)],[c_272925,c_272891]) ).
cnf(c_277324,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_277323,c_274705]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL458+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n007.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 Aug 24 18:01:10 EDT 2023
% 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 94.79/13.75 % SZS status Started for theBenchmark.p
% 94.79/13.75 % SZS status Theorem for theBenchmark.p
% 94.79/13.75
% 94.79/13.75 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 94.79/13.75
% 94.79/13.75 ------ iProver source info
% 94.79/13.75
% 94.79/13.75 git: date: 2023-05-31 18:12:56 +0000
% 94.79/13.75 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 94.79/13.75 git: non_committed_changes: false
% 94.79/13.75 git: last_make_outside_of_git: false
% 94.79/13.75
% 94.79/13.75 ------ Parsing...
% 94.79/13.75 ------ Clausification by vclausify_rel & Parsing by iProver...
% 94.79/13.75
% 94.79/13.75 ------ Preprocessing... sup_sim: 3 sf_s rm: 22 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 94.79/13.75
% 94.79/13.75 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 94.79/13.75
% 94.79/13.75 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 94.79/13.75 ------ Proving...
% 94.79/13.75 ------ Problem Properties
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75 clauses 21
% 94.79/13.75 conjectures 0
% 94.79/13.75 EPR 0
% 94.79/13.75 Horn 21
% 94.79/13.75 unary 19
% 94.79/13.75 binary 1
% 94.79/13.75 lits 24
% 94.79/13.75 lits eq 6
% 94.79/13.75 fd_pure 0
% 94.79/13.75 fd_pseudo 0
% 94.79/13.75 fd_cond 0
% 94.79/13.75 fd_pseudo_cond 1
% 94.79/13.75 AC symbols 0
% 94.79/13.75
% 94.79/13.75 ------ Schedule dynamic 5 is on
% 94.79/13.75
% 94.79/13.75 ------ no conjectures: strip conj schedule
% 94.79/13.75
% 94.79/13.75 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75 ------
% 94.79/13.75 Current options:
% 94.79/13.75 ------
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75 ------ Proving...
% 94.79/13.75 Proof_search_loop: time out after: 5684 full_loop iterations
% 94.79/13.75
% 94.79/13.75 ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" stripped conjectures Time Limit: 15.
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75 ------
% 94.79/13.75 Current options:
% 94.79/13.75 ------
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75 ------ Proving...
% 94.79/13.75
% 94.79/13.75
% 94.79/13.75 % SZS status Theorem for theBenchmark.p
% 94.79/13.75
% 94.79/13.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 94.79/13.75
% 94.79/13.76
%------------------------------------------------------------------------------