TSTP Solution File: LCL476+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL476+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:40 EDT 2023
% Result : CounterSatisfiable 250.21s 33.37s
% Output : Saturation 250.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% 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/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f19,axiom,
( cn1
<=> ! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X5),implies(X3,X5)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn1) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
fof(f21,axiom,
( cn3
<=> ! [X3] : is_a_theorem(implies(implies(not(X3),X3),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn3) ).
fof(f23,axiom,
( r2
<=> ! [X3,X4] : is_a_theorem(implies(X4,or(X3,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_equiv) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_modus_ponens) ).
fof(f36,axiom,
cn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn1) ).
fof(f37,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f38,axiom,
cn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn3) ).
fof(f39,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_equiv) ).
fof(f43,conjecture,
r2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r2) ).
fof(f44,negated_conjecture,
~ r2,
inference(negated_conjecture,[],[f43]) ).
fof(f48,plain,
( cn1
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(rectify,[],[f19]) ).
fof(f49,plain,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(rectify,[],[f20]) ).
fof(f50,plain,
( cn3
<=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(rectify,[],[f21]) ).
fof(f52,plain,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(rectify,[],[f23]) ).
fof(f56,plain,
~ r2,
inference(flattening,[],[f44]) ).
fof(f57,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
=> r2 ),
inference(unused_predicate_definition_removal,[],[f52]) ).
fof(f58,plain,
( cn3
=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f59,plain,
( cn2
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(unused_predicate_definition_removal,[],[f49]) ).
fof(f60,plain,
( cn1
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f48]) ).
fof(f61,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
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(f65,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f62]) ).
fof(f66,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f61]) ).
fof(f68,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ cn1 ),
inference(ennf_transformation,[],[f60]) ).
fof(f69,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(ennf_transformation,[],[f59]) ).
fof(f70,plain,
( ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ cn3 ),
inference(ennf_transformation,[],[f58]) ).
fof(f71,plain,
( r2
| ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f57]) ).
fof(f72,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f73,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f74,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
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,X1] : ~ is_a_theorem(implies(X1,or(X0,X1)))
=> ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f77,plain,
( r2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f71,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,[],[f66]) ).
fof(f79,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f67]) ).
fof(f80,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ cn1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f81,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f82,plain,
! [X0] :
( is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ cn3 ),
inference(cnf_transformation,[],[f70]) ).
fof(f83,plain,
( r2
| ~ is_a_theorem(implies(sK1,or(sK0,sK1))) ),
inference(cnf_transformation,[],[f77]) ).
fof(f84,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f72]) ).
fof(f85,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f73]) ).
fof(f86,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f74]) ).
fof(f87,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f75]) ).
fof(f88,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f89,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f90,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f91,plain,
cn1,
inference(cnf_transformation,[],[f36]) ).
fof(f92,plain,
cn2,
inference(cnf_transformation,[],[f37]) ).
fof(f93,plain,
cn3,
inference(cnf_transformation,[],[f38]) ).
fof(f94,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f95,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f96,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f97,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f98,plain,
~ r2,
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_50,plain,
( ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents
| X0 = X1 ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_51,plain,
( ~ cn1
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(cnf_transformation,[],[f80]) ).
cnf(c_52,plain,
( ~ cn2
| is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_53,plain,
( ~ cn3
| is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_54,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| r2 ),
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_and
| not(or(not(X0),not(X1))) = and(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_57,plain,
( ~ op_implies_or
| or(not(X0),X1) = implies(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_58,plain,
( ~ op_equiv
| and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_59,plain,
op_or,
inference(cnf_transformation,[],[f88]) ).
cnf(c_60,plain,
op_equiv,
inference(cnf_transformation,[],[f89]) ).
cnf(c_61,plain,
modus_ponens,
inference(cnf_transformation,[],[f90]) ).
cnf(c_62,plain,
cn1,
inference(cnf_transformation,[],[f91]) ).
cnf(c_63,plain,
cn2,
inference(cnf_transformation,[],[f92]) ).
cnf(c_64,plain,
cn3,
inference(cnf_transformation,[],[f93]) ).
cnf(c_65,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f94]) ).
cnf(c_66,plain,
op_implies_or,
inference(cnf_transformation,[],[f95]) ).
cnf(c_67,plain,
op_and,
inference(cnf_transformation,[],[f96]) ).
cnf(c_68,plain,
op_equiv,
inference(cnf_transformation,[],[f97]) ).
cnf(c_69,negated_conjecture,
~ r2,
inference(cnf_transformation,[],[f98]) ).
cnf(c_78,plain,
~ is_a_theorem(implies(sK1,or(sK0,sK1))),
inference(global_subsumption_just,[status(thm)],[c_54,c_69,c_54]) ).
cnf(c_80,plain,
is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(global_subsumption_just,[status(thm)],[c_53,c_64,c_53]) ).
cnf(c_83,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(global_subsumption_just,[status(thm)],[c_52,c_63,c_52]) ).
cnf(c_86,plain,
or(not(X0),X1) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_57,c_66,c_57]) ).
cnf(c_89,plain,
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(global_subsumption_just,[status(thm)],[c_50,c_65,c_50]) ).
cnf(c_92,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_93,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_92]) ).
cnf(c_94,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_56,c_67,c_56]) ).
cnf(c_97,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_55,c_59,c_55]) ).
cnf(c_100,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_58,c_68,c_58]) ).
cnf(c_103,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(global_subsumption_just,[status(thm)],[c_51,c_62,c_51]) ).
cnf(c_152,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_94,c_86]) ).
cnf(c_197,plain,
X0_1 = X0_1,
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : LCL476+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 01:08:51 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 250.21/33.37 % SZS status Started for theBenchmark.p
% 250.21/33.37 % SZS status CounterSatisfiable for theBenchmark.p
% 250.21/33.37
% 250.21/33.37 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 250.21/33.37
% 250.21/33.37 ------ iProver source info
% 250.21/33.37
% 250.21/33.37 git: date: 2023-05-31 18:12:56 +0000
% 250.21/33.37 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 250.21/33.37 git: non_committed_changes: false
% 250.21/33.37 git: last_make_outside_of_git: false
% 250.21/33.37
% 250.21/33.37 ------ Parsing...
% 250.21/33.37 ------ Clausification by vclausify_rel & Parsing by iProver...
% 250.21/33.37
% 250.21/33.37 ------ Preprocessing... sup_sim: 1 sf_s rm: 11 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 250.21/33.37
% 250.21/33.37 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 250.21/33.37
% 250.21/33.37 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 250.21/33.37 ------ Proving...
% 250.21/33.37 ------ Problem Properties
% 250.21/33.37
% 250.21/33.37
% 250.21/33.37 clauses 10
% 250.21/33.37 conjectures 0
% 250.21/33.37 EPR 0
% 250.21/33.37 Horn 10
% 250.21/33.37 unary 8
% 250.21/33.37 binary 1
% 250.21/33.37 lits 13
% 250.21/33.37 lits eq 5
% 250.21/33.37 fd_pure 0
% 250.21/33.37 fd_pseudo 0
% 250.21/33.37 fd_cond 0
% 250.21/33.37 fd_pseudo_cond 1
% 250.21/33.37 AC symbols 0
% 250.21/33.37
% 250.21/33.37 ------ Input Options Time Limit: Unbounded
% 250.21/33.37
% 250.21/33.37
% 250.21/33.37 ------
% 250.21/33.37 Current options:
% 250.21/33.37 ------
% 250.21/33.37
% 250.21/33.37
% 250.21/33.37
% 250.21/33.37
% 250.21/33.37 ------ Proving...
% 250.21/33.37
% 250.21/33.37
% 250.21/33.37 % SZS status CounterSatisfiable for theBenchmark.p
% 250.21/33.37
% 250.21/33.37 % SZS output start Saturation for theBenchmark.p
% See solution above
% 250.21/33.37
% 250.21/33.39
%------------------------------------------------------------------------------