TSTP Solution File: LCL517+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL517+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:51 EDT 2023
% Result : Theorem 1.18s 1.22s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 17
% Syntax : Number of formulae : 117 ( 51 unt; 0 def)
% Number of atoms : 199 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 151 ( 69 ~; 60 |; 2 &)
% ( 9 <=>; 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 : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 164 ( 6 sgn; 61 !; 2 ?)
% 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(f16,axiom,
( kn1
<=> ! [X3] : is_a_theorem(implies(X3,and(X3,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn3) ).
fof(f21,axiom,
( cn3
<=> ! [X3] : is_a_theorem(implies(implies(not(X3),X3),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn3) ).
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(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(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(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f40,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_equiv) ).
fof(f43,conjecture,
cn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn3) ).
fof(f44,negated_conjecture,
~ cn3,
inference(negated_conjecture,[],[f43]) ).
fof(f45,plain,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(rectify,[],[f16]) ).
fof(f46,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f47,plain,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(rectify,[],[f18]) ).
fof(f50,plain,
( cn3
<=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(rectify,[],[f21]) ).
fof(f56,plain,
~ cn3,
inference(flattening,[],[f44]) ).
fof(f57,plain,
( ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0))
=> cn3 ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f58,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f47]) ).
fof(f59,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f60,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f62,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(f66,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f62]) ).
fof(f67,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f66]) ).
fof(f69,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f60]) ).
fof(f70,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f59]) ).
fof(f71,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f58]) ).
fof(f72,plain,
( cn3
| ? [X0] : ~ is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(ennf_transformation,[],[f57]) ).
fof(f73,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f74,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f75,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f76,plain,
( ? [X0] : ~ is_a_theorem(implies(implies(not(X0),X0),X0))
=> ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f77,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f72,f76]) ).
fof(f78,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f67]) ).
fof(f80,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f81,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f82,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f71]) ).
fof(f83,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
inference(cnf_transformation,[],[f77]) ).
fof(f84,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f73]) ).
fof(f85,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f74]) ).
fof(f86,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f75]) ).
fof(f88,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f90,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f91,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f92,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f93,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f95,plain,
op_or,
inference(cnf_transformation,[],[f40]) ).
fof(f96,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f97,plain,
~ cn3,
inference(cnf_transformation,[],[f56]) ).
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_51,plain,
( ~ kn1
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f80]) ).
cnf(c_52,plain,
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_53,plain,
( ~ kn3
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_54,plain,
( ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0))
| cn3 ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_55,plain,
( ~ op_or
| not(and(not(X0),not(X1))) = or(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
cnf(c_56,plain,
( ~ op_implies_and
| not(and(X0,not(X1))) = implies(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_57,plain,
( ~ op_equiv
| and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_59,plain,
op_implies_and,
inference(cnf_transformation,[],[f88]) ).
cnf(c_61,plain,
modus_ponens,
inference(cnf_transformation,[],[f90]) ).
cnf(c_62,plain,
kn1,
inference(cnf_transformation,[],[f91]) ).
cnf(c_63,plain,
kn2,
inference(cnf_transformation,[],[f92]) ).
cnf(c_64,plain,
kn3,
inference(cnf_transformation,[],[f93]) ).
cnf(c_66,plain,
op_or,
inference(cnf_transformation,[],[f95]) ).
cnf(c_67,plain,
op_equiv,
inference(cnf_transformation,[],[f96]) ).
cnf(c_68,negated_conjecture,
~ cn3,
inference(cnf_transformation,[],[f97]) ).
cnf(c_76,plain,
is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_52,c_63,c_52]) ).
cnf(c_79,plain,
is_a_theorem(implies(X0,and(X0,X0))),
inference(global_subsumption_just,[status(thm)],[c_51,c_62,c_51]) ).
cnf(c_82,plain,
~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)),
inference(global_subsumption_just,[status(thm)],[c_54,c_68,c_54]) ).
cnf(c_87,plain,
not(and(X0,not(X1))) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_56,c_59,c_56]) ).
cnf(c_90,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_61,c_49]) ).
cnf(c_91,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_90]) ).
cnf(c_92,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_55,c_66,c_55]) ).
cnf(c_95,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_57,c_67,c_57]) ).
cnf(c_98,plain,
is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(global_subsumption_just,[status(thm)],[c_53,c_64,c_53]) ).
cnf(c_151,plain,
implies(not(X0),X1) = or(X0,X1),
inference(demodulation,[status(thm)],[c_92,c_87]) ).
cnf(c_152,plain,
~ is_a_theorem(implies(or(sK0,sK0),sK0)),
inference(demodulation,[status(thm)],[c_82,c_151]) ).
cnf(c_153,plain,
is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))),
inference(demodulation,[status(thm)],[c_98,c_151]) ).
cnf(c_347,plain,
or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[status(thm)],[c_87,c_151]) ).
cnf(c_358,plain,
( ~ is_a_theorem(and(X0,X1))
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_76,c_91]) ).
cnf(c_372,plain,
is_a_theorem(implies(implies(X0,X0),equiv(X0,X0))),
inference(superposition,[status(thm)],[c_95,c_79]) ).
cnf(c_373,plain,
is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))),
inference(superposition,[status(thm)],[c_95,c_76]) ).
cnf(c_380,plain,
is_a_theorem(implies(implies(not(X0),X1),or(and(X1,X2),implies(X2,X0)))),
inference(superposition,[status(thm)],[c_87,c_153]) ).
cnf(c_383,plain,
is_a_theorem(implies(or(X0,X1),or(and(X1,X2),implies(X2,X0)))),
inference(light_normalisation,[status(thm)],[c_380,c_151]) ).
cnf(c_415,plain,
is_a_theorem(implies(equiv(not(X0),X1),or(X0,X1))),
inference(superposition,[status(thm)],[c_151,c_373]) ).
cnf(c_435,plain,
( ~ is_a_theorem(equiv(not(X0),X1))
| is_a_theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_415,c_91]) ).
cnf(c_465,plain,
is_a_theorem(implies(or(X0,X1),or(and(X1,not(X2)),or(X2,X0)))),
inference(superposition,[status(thm)],[c_151,c_383]) ).
cnf(c_466,plain,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(and(X1,X2),implies(X2,X0))) ),
inference(superposition,[status(thm)],[c_383,c_91]) ).
cnf(c_575,plain,
is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X2,X0)))),
inference(demodulation,[status(thm)],[c_465,c_347]) ).
cnf(c_579,plain,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(implies(implies(X1,X2),or(X2,X0))) ),
inference(superposition,[status(thm)],[c_575,c_91]) ).
cnf(c_657,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(or(X2,X0))
| is_a_theorem(or(X1,X2)) ),
inference(superposition,[status(thm)],[c_579,c_91]) ).
cnf(c_1103,plain,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(and(X1,X1),X0)) ),
inference(superposition,[status(thm)],[c_79,c_657]) ).
cnf(c_1104,plain,
( ~ is_a_theorem(or(X0,and(X1,X2)))
| is_a_theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_76,c_657]) ).
cnf(c_1106,plain,
( ~ is_a_theorem(or(X0,implies(X1,X1)))
| is_a_theorem(or(equiv(X1,X1),X0)) ),
inference(superposition,[status(thm)],[c_372,c_657]) ).
cnf(c_1194,plain,
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(implies(not(X1),X1),X0)) ),
inference(superposition,[status(thm)],[c_347,c_1103]) ).
cnf(c_1208,plain,
( ~ is_a_theorem(or(and(X0,X1),X2))
| is_a_theorem(or(X0,and(X2,X2))) ),
inference(superposition,[status(thm)],[c_1103,c_1104]) ).
cnf(c_1250,plain,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(equiv(X0,X0),and(X1,X0))) ),
inference(superposition,[status(thm)],[c_466,c_1106]) ).
cnf(c_1287,plain,
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(or(X1,X1),X0)) ),
inference(demodulation,[status(thm)],[c_1194,c_151]) ).
cnf(c_1295,plain,
( ~ is_a_theorem(or(X0,not(X1)))
| ~ is_a_theorem(or(X1,X1))
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_1287,c_91]) ).
cnf(c_1296,plain,
~ is_a_theorem(or(sK0,not(sK0))),
inference(superposition,[status(thm)],[c_1287,c_152]) ).
cnf(c_1380,plain,
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(or(X0,and(X2,X2))) ),
inference(superposition,[status(thm)],[c_347,c_1208]) ).
cnf(c_1457,plain,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,equiv(X0,X0))) ),
inference(superposition,[status(thm)],[c_1250,c_1104]) ).
cnf(c_1697,plain,
is_a_theorem(or(X0,and(equiv(X0,X0),equiv(X0,X0)))),
inference(superposition,[status(thm)],[c_372,c_1380]) ).
cnf(c_1764,plain,
is_a_theorem(or(equiv(X0,X0),X0)),
inference(superposition,[status(thm)],[c_1697,c_1104]) ).
cnf(c_1775,plain,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(equiv(not(X0),not(X0))) ),
inference(superposition,[status(thm)],[c_1764,c_1295]) ).
cnf(c_1915,plain,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(or(X0,not(X0))) ),
inference(superposition,[status(thm)],[c_1775,c_435]) ).
cnf(c_1975,plain,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_1915,c_1295]) ).
cnf(c_2397,plain,
( ~ is_a_theorem(or(and(X0,X0),X0))
| is_a_theorem(and(X0,X0)) ),
inference(superposition,[status(thm)],[c_1103,c_1975]) ).
cnf(c_2428,plain,
( ~ is_a_theorem(or(X0,and(equiv(X0,X0),equiv(X0,X0))))
| is_a_theorem(and(equiv(X0,X0),equiv(X0,X0))) ),
inference(superposition,[status(thm)],[c_1457,c_2397]) ).
cnf(c_2437,plain,
is_a_theorem(and(equiv(X0,X0),equiv(X0,X0))),
inference(forward_subsumption_resolution,[status(thm)],[c_2428,c_1697]) ).
cnf(c_2471,plain,
is_a_theorem(equiv(X0,X0)),
inference(superposition,[status(thm)],[c_2437,c_358]) ).
cnf(c_2484,plain,
is_a_theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_2471,c_435]) ).
cnf(c_2485,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1296,c_2484]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL517+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n006.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 : 300
% 0.13/0.35 % DateTime : Thu Aug 24 17:43:38 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.18/1.22 % SZS status Started for theBenchmark.p
% 1.18/1.22 % SZS status Theorem for theBenchmark.p
% 1.18/1.22
% 1.18/1.22 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.18/1.22
% 1.18/1.22 ------ iProver source info
% 1.18/1.22
% 1.18/1.22 git: date: 2023-05-31 18:12:56 +0000
% 1.18/1.22 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.18/1.22 git: non_committed_changes: false
% 1.18/1.22 git: last_make_outside_of_git: false
% 1.18/1.22
% 1.18/1.22 ------ Parsing...
% 1.18/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.18/1.22
% 1.18/1.22 ------ Preprocessing... sup_sim: 3 sf_s rm: 10 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.18/1.22
% 1.18/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.18/1.22
% 1.18/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.18/1.22 ------ Proving...
% 1.18/1.22 ------ Problem Properties
% 1.18/1.22
% 1.18/1.22
% 1.18/1.22 clauses 9
% 1.18/1.22 conjectures 0
% 1.18/1.22 EPR 0
% 1.18/1.22 Horn 9
% 1.18/1.22 unary 7
% 1.18/1.22 binary 1
% 1.18/1.22 lits 12
% 1.18/1.22 lits eq 4
% 1.18/1.22 fd_pure 0
% 1.18/1.22 fd_pseudo 0
% 1.18/1.22 fd_cond 0
% 1.18/1.22 fd_pseudo_cond 1
% 1.18/1.22 AC symbols 0
% 1.18/1.22
% 1.18/1.22 ------ Schedule dynamic 5 is on
% 1.18/1.22
% 1.18/1.22 ------ no conjectures: strip conj schedule
% 1.18/1.22
% 1.18/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.18/1.22
% 1.18/1.22
% 1.18/1.22 ------
% 1.18/1.22 Current options:
% 1.18/1.22 ------
% 1.18/1.22
% 1.18/1.22
% 1.18/1.22
% 1.18/1.22
% 1.18/1.22 ------ Proving...
% 1.18/1.22
% 1.18/1.22
% 1.18/1.22 % SZS status Theorem for theBenchmark.p
% 1.18/1.22
% 1.18/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.18/1.22
% 1.18/1.23
%------------------------------------------------------------------------------