TSTP Solution File: LCL910+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL910+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:52:57 EDT 2023
% Result : Satisfiable 1.38s 1.12s
% Output : Saturation 1.38s
% 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(f16,axiom,
( kn1
<=> ! [X3] : is_a_theorem(implies(X3,and(X3,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',kn3) ).
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(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_equiv) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f39,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f40,plain,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(rectify,[],[f16]) ).
fof(f41,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f42,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(f51,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,[],[f42]) ).
fof(f52,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f41]) ).
fof(f53,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f40]) ).
fof(f54,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f55,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(f58,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f59,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f54]) ).
fof(f61,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f53]) ).
fof(f62,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f52]) ).
fof(f63,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f51]) ).
fof(f64,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f65,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f66,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f67,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f59]) ).
fof(f68,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f60]) ).
fof(f69,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f61]) ).
fof(f70,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f62]) ).
fof(f71,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f63]) ).
fof(f72,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f64]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f65]) ).
fof(f74,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f66]) ).
fof(f75,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f76,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f77,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f78,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f79,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f80,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f81,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f82,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_50,plain,
( ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_51,plain,
( ~ kn1
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_52,plain,
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_53,plain,
( ~ kn3
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_54,plain,
( ~ op_or
| not(and(not(X0),not(X1))) = or(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_55,plain,
( ~ op_implies_and
| not(and(X0,not(X1))) = implies(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_56,plain,
( ~ op_equiv
| and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
cnf(c_57,plain,
op_or,
inference(cnf_transformation,[],[f75]) ).
cnf(c_58,plain,
op_implies_and,
inference(cnf_transformation,[],[f76]) ).
cnf(c_59,plain,
op_equiv,
inference(cnf_transformation,[],[f77]) ).
cnf(c_60,plain,
modus_ponens,
inference(cnf_transformation,[],[f78]) ).
cnf(c_61,plain,
kn1,
inference(cnf_transformation,[],[f79]) ).
cnf(c_62,plain,
kn2,
inference(cnf_transformation,[],[f80]) ).
cnf(c_63,plain,
kn3,
inference(cnf_transformation,[],[f81]) ).
cnf(c_64,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f82]) ).
cnf(c_72,plain,
is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_52,c_62,c_52]) ).
cnf(c_75,plain,
is_a_theorem(implies(X0,and(X0,X0))),
inference(global_subsumption_just,[status(thm)],[c_51,c_61,c_51]) ).
cnf(c_78,plain,
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(global_subsumption_just,[status(thm)],[c_50,c_64,c_50]) ).
cnf(c_81,plain,
not(and(X0,not(X1))) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_55,c_58,c_55]) ).
cnf(c_84,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_60,c_49]) ).
cnf(c_85,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_84]) ).
cnf(c_86,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_54,c_57,c_54]) ).
cnf(c_89,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_56,c_59,c_56]) ).
cnf(c_92,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_63,c_53]) ).
cnf(c_141,plain,
implies(not(X0),X1) = or(X0,X1),
inference(demodulation,[status(thm)],[c_86,c_81]) ).
cnf(c_142,plain,
is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))),
inference(demodulation,[status(thm)],[c_92,c_141]) ).
cnf(c_143,plain,
X0 = X0,
theory(equality) ).
cnf(c_144,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_145,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_146,plain,
( X0 != X1
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
theory(equality) ).
cnf(c_147,plain,
( X0 != X1
| X2 != X3
| implies(X0,X2) = implies(X1,X3) ),
theory(equality) ).
cnf(c_148,plain,
( X0 != X1
| X2 != X3
| and(X0,X2) = and(X1,X3) ),
theory(equality) ).
cnf(c_149,plain,
( X0 != X1
| not(X0) = not(X1) ),
theory(equality) ).
cnf(c_150,plain,
( X0 != X1
| X2 != X3
| or(X0,X2) = or(X1,X3) ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL910+1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.13/0.31 % Computer : n027.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Fri Aug 25 06:27:18 EDT 2023
% 0.13/0.31 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.58 WARNING - Could not infer the problem pformat. Setting FOF as default
% 1.38/1.12 % SZS status Started for theBenchmark.p
% 1.38/1.12 % SZS status Satisfiable for theBenchmark.p
% 1.38/1.12
% 1.38/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.38/1.12
% 1.38/1.12 ------ iProver source info
% 1.38/1.12
% 1.38/1.12 git: date: 2023-05-31 18:12:56 +0000
% 1.38/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.38/1.12 git: non_committed_changes: false
% 1.38/1.12 git: last_make_outside_of_git: false
% 1.38/1.12
% 1.38/1.12 ------ Parsing...
% 1.38/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.38/1.12
% 1.38/1.12 ------ Preprocessing... sup_sim: 2 sf_s rm: 24 0s sf_e pe_s pe_e sf_s rm: 8 0s sf_e pe_s pe_e
% 1.38/1.12
% 1.38/1.12 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.38/1.12 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.38/1.12 ------ Proving...
% 1.38/1.12 ------ Problem Properties
% 1.38/1.12
% 1.38/1.12
% 1.38/1.12 clauses 0
% 1.38/1.12 conjectures 0
% 1.38/1.12 EPR 0
% 1.38/1.12 Horn 0
% 1.38/1.12 unary 0
% 1.38/1.12 binary 0
% 1.38/1.12 lits 0
% 1.38/1.12 lits eq 0
% 1.38/1.12 fd_pure 0
% 1.38/1.12 fd_pseudo 0
% 1.38/1.12 fd_cond 0
% 1.38/1.12 fd_pseudo_cond 0
% 1.38/1.12 AC symbols 0
% 1.38/1.12
% 1.38/1.12 ------ Schedule EPR Horn non eq is on
% 1.38/1.12
% 1.38/1.12 ------ no conjectures: strip conj schedule
% 1.38/1.12
% 1.38/1.12 ------ no equalities: superposition off
% 1.38/1.12
% 1.38/1.12 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.38/1.12
% 1.38/1.12
% 1.38/1.12
% 1.38/1.12
% 1.38/1.12 % SZS status Satisfiable for theBenchmark.p
% 1.38/1.12
% 1.38/1.12 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.38/1.12
% 1.38/1.12
%------------------------------------------------------------------------------