TSTP Solution File: LCL913+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL913+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:58 EDT 2023
% Result : Satisfiable 1.40s 1.19s
% Output : Saturation 1.40s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f5,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(f7,axiom,
( modus_ponens_strict_implies
<=> ! [X0,X1] :
( ( is_a_theorem(strict_implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens_strict_implies) ).
fof(f8,axiom,
( adjunction
<=> ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(X0) )
=> is_a_theorem(and(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',adjunction) ).
fof(f9,axiom,
( substitution_strict_equiv
<=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution_strict_equiv) ).
fof(f19,axiom,
( axiom_m1
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m1) ).
fof(f20,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m2) ).
fof(f21,axiom,
( axiom_m3
<=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m3) ).
fof(f22,axiom,
( axiom_m4
<=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m4) ).
fof(f23,axiom,
( axiom_m5
<=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m5) ).
fof(f29,axiom,
( op_possibly
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_possibly) ).
fof(f31,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f32,axiom,
( op_strict_equiv
=> ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_equiv) ).
fof(f33,axiom,
op_possibly,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_possibly) ).
fof(f34,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_or) ).
fof(f36,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f37,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_equiv) ).
fof(f38,axiom,
op_strict_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f39,axiom,
modus_ponens_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(f40,axiom,
substitution_strict_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f41,axiom,
adjunction,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(f42,axiom,
axiom_m1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m1) ).
fof(f43,axiom,
axiom_m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f44,axiom,
axiom_m3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m3) ).
fof(f45,axiom,
axiom_m4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f46,axiom,
axiom_m5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m5) ).
fof(f50,plain,
( axiom_m5
=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f51,plain,
( axiom_m4
=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f52,plain,
( axiom_m3
=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f53,plain,
( axiom_m2
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f54,plain,
( axiom_m1
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f55,plain,
( substitution_strict_equiv
=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f56,plain,
( adjunction
=> ! [X0,X1] :
( ( is_a_theorem(X1)
& is_a_theorem(X0) )
=> is_a_theorem(and(X0,X1)) ) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f57,plain,
( modus_ponens_strict_implies
=> ! [X0,X1] :
( ( is_a_theorem(strict_implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f63,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f1]) ).
fof(f64,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f5]) ).
fof(f65,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens_strict_implies ),
inference(ennf_transformation,[],[f57]) ).
fof(f66,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens_strict_implies ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ adjunction ),
inference(ennf_transformation,[],[f56]) ).
fof(f68,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ adjunction ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1)) )
| ~ substitution_strict_equiv ),
inference(ennf_transformation,[],[f55]) ).
fof(f70,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(ennf_transformation,[],[f54]) ).
fof(f71,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(ennf_transformation,[],[f53]) ).
fof(f72,plain,
( ! [X0,X1,X2] : is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2))))
| ~ axiom_m3 ),
inference(ennf_transformation,[],[f52]) ).
fof(f73,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(ennf_transformation,[],[f51]) ).
fof(f74,plain,
( ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))
| ~ axiom_m5 ),
inference(ennf_transformation,[],[f50]) ).
fof(f75,plain,
( ! [X0] : possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(ennf_transformation,[],[f29]) ).
fof(f76,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f31]) ).
fof(f77,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f32]) ).
fof(f78,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f63]) ).
fof(f79,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f64]) ).
fof(f80,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens_strict_implies ),
inference(cnf_transformation,[],[f66]) ).
fof(f81,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ adjunction ),
inference(cnf_transformation,[],[f68]) ).
fof(f82,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1))
| ~ substitution_strict_equiv ),
inference(cnf_transformation,[],[f69]) ).
fof(f83,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(cnf_transformation,[],[f70]) ).
fof(f84,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(cnf_transformation,[],[f71]) ).
fof(f85,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2))))
| ~ axiom_m3 ),
inference(cnf_transformation,[],[f72]) ).
fof(f86,plain,
! [X0] :
( is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(cnf_transformation,[],[f73]) ).
fof(f87,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))
| ~ axiom_m5 ),
inference(cnf_transformation,[],[f74]) ).
fof(f88,plain,
! [X0] :
( possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(cnf_transformation,[],[f75]) ).
fof(f89,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f76]) ).
fof(f90,plain,
! [X0,X1] :
( strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f77]) ).
fof(f91,plain,
op_possibly,
inference(cnf_transformation,[],[f33]) ).
fof(f92,plain,
op_or,
inference(cnf_transformation,[],[f34]) ).
fof(f93,plain,
op_strict_implies,
inference(cnf_transformation,[],[f36]) ).
fof(f94,plain,
op_equiv,
inference(cnf_transformation,[],[f37]) ).
fof(f95,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f38]) ).
fof(f96,plain,
modus_ponens_strict_implies,
inference(cnf_transformation,[],[f39]) ).
fof(f97,plain,
substitution_strict_equiv,
inference(cnf_transformation,[],[f40]) ).
fof(f98,plain,
adjunction,
inference(cnf_transformation,[],[f41]) ).
fof(f99,plain,
axiom_m1,
inference(cnf_transformation,[],[f42]) ).
fof(f100,plain,
axiom_m2,
inference(cnf_transformation,[],[f43]) ).
fof(f101,plain,
axiom_m3,
inference(cnf_transformation,[],[f44]) ).
fof(f102,plain,
axiom_m4,
inference(cnf_transformation,[],[f45]) ).
fof(f103,plain,
axiom_m5,
inference(cnf_transformation,[],[f46]) ).
cnf(c_49,plain,
( ~ op_or
| not(and(not(X0),not(X1))) = or(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_50,plain,
( ~ op_equiv
| and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_51,plain,
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens_strict_implies
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f80]) ).
cnf(c_52,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ adjunction
| is_a_theorem(and(X0,X1)) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_53,plain,
( ~ is_a_theorem(strict_equiv(X0,X1))
| ~ substitution_strict_equiv
| X0 = X1 ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_54,plain,
( ~ axiom_m1
| is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_55,plain,
( ~ axiom_m2
| is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f84]) ).
cnf(c_56,plain,
( ~ axiom_m3
| is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_57,plain,
( ~ axiom_m4
| is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_58,plain,
( ~ axiom_m5
| is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_59,plain,
( ~ op_possibly
| not(necessarily(not(X0))) = possibly(X0) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_60,plain,
( ~ op_strict_implies
| necessarily(implies(X0,X1)) = strict_implies(X0,X1) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_61,plain,
( ~ op_strict_equiv
| and(strict_implies(X0,X1),strict_implies(X1,X0)) = strict_equiv(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
cnf(c_62,plain,
op_possibly,
inference(cnf_transformation,[],[f91]) ).
cnf(c_63,plain,
op_or,
inference(cnf_transformation,[],[f92]) ).
cnf(c_64,plain,
op_strict_implies,
inference(cnf_transformation,[],[f93]) ).
cnf(c_65,plain,
op_equiv,
inference(cnf_transformation,[],[f94]) ).
cnf(c_66,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f95]) ).
cnf(c_67,plain,
modus_ponens_strict_implies,
inference(cnf_transformation,[],[f96]) ).
cnf(c_68,plain,
substitution_strict_equiv,
inference(cnf_transformation,[],[f97]) ).
cnf(c_69,plain,
adjunction,
inference(cnf_transformation,[],[f98]) ).
cnf(c_70,plain,
axiom_m1,
inference(cnf_transformation,[],[f99]) ).
cnf(c_71,plain,
axiom_m2,
inference(cnf_transformation,[],[f100]) ).
cnf(c_72,plain,
axiom_m3,
inference(cnf_transformation,[],[f101]) ).
cnf(c_73,plain,
axiom_m4,
inference(cnf_transformation,[],[f102]) ).
cnf(c_74,plain,
axiom_m5,
inference(cnf_transformation,[],[f103]) ).
cnf(c_87,plain,
is_a_theorem(strict_implies(X0,and(X0,X0))),
inference(global_subsumption_just,[status(thm)],[c_57,c_73,c_57]) ).
cnf(c_90,plain,
is_a_theorem(strict_implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_55,c_71,c_55]) ).
cnf(c_93,plain,
not(necessarily(not(X0))) = possibly(X0),
inference(global_subsumption_just,[status(thm)],[c_59,c_62,c_59]) ).
cnf(c_96,plain,
is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_54,c_70,c_54]) ).
cnf(c_99,plain,
necessarily(implies(X0,X1)) = strict_implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_60,c_64,c_60]) ).
cnf(c_102,plain,
( ~ is_a_theorem(strict_equiv(X0,X1))
| X0 = X1 ),
inference(global_subsumption_just,[status(thm)],[c_53,c_68,c_53]) ).
cnf(c_105,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| is_a_theorem(and(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_69,c_52]) ).
cnf(c_106,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(and(X0,X1)) ),
inference(renaming,[status(thm)],[c_105]) ).
cnf(c_108,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_67,c_51]) ).
cnf(c_109,plain,
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(renaming,[status(thm)],[c_108]) ).
cnf(c_110,plain,
not(and(not(X0),not(X1))) = or(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_49,c_63,c_49]) ).
cnf(c_113,plain,
and(strict_implies(X0,X1),strict_implies(X1,X0)) = strict_equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_61,c_66,c_61]) ).
cnf(c_116,plain,
is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))),
inference(global_subsumption_just,[status(thm)],[c_58,c_74,c_58]) ).
cnf(c_119,plain,
is_a_theorem(strict_implies(and(and(X0,X1),X2),and(X0,and(X1,X2)))),
inference(global_subsumption_just,[status(thm)],[c_56,c_72,c_56]) ).
cnf(c_122,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_50,c_65,c_50]) ).
cnf(c_201,plain,
X0 = X0,
theory(equality) ).
cnf(c_202,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_203,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_204,plain,
( X0 != X1
| not(X0) = not(X1) ),
theory(equality) ).
cnf(c_205,plain,
( X0 != X1
| X2 != X3
| and(X0,X2) = and(X1,X3) ),
theory(equality) ).
cnf(c_206,plain,
( X0 != X1
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
theory(equality) ).
cnf(c_207,plain,
( X0 != X1
| X2 != X3
| strict_implies(X0,X2) = strict_implies(X1,X3) ),
theory(equality) ).
cnf(c_208,plain,
( X0 != X1
| necessarily(X0) = necessarily(X1) ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL913+1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 17:56:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.60 WARNING - Could not infer the problem pformat. Setting FOF as default
% 1.40/1.19 % SZS status Started for theBenchmark.p
% 1.40/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.40/1.19
% 1.40/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.40/1.19
% 1.40/1.19 ------ iProver source info
% 1.40/1.19
% 1.40/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.40/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.40/1.19 git: non_committed_changes: false
% 1.40/1.19 git: last_make_outside_of_git: false
% 1.40/1.19
% 1.40/1.19 ------ Parsing...
% 1.40/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.40/1.19
% 1.40/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 34 0s sf_e pe_s pe_e sf_s rm: 8 0s sf_e pe_s pe_e
% 1.40/1.19
% 1.40/1.19 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.40/1.19 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.40/1.19 ------ Proving...
% 1.40/1.19 ------ Problem Properties
% 1.40/1.19
% 1.40/1.19
% 1.40/1.19 clauses 0
% 1.40/1.19 conjectures 0
% 1.40/1.19 EPR 0
% 1.40/1.19 Horn 0
% 1.40/1.19 unary 0
% 1.40/1.19 binary 0
% 1.40/1.19 lits 0
% 1.40/1.19 lits eq 0
% 1.40/1.19 fd_pure 0
% 1.40/1.19 fd_pseudo 0
% 1.40/1.19 fd_cond 0
% 1.40/1.19 fd_pseudo_cond 0
% 1.40/1.19 AC symbols 0
% 1.40/1.19
% 1.40/1.19 ------ Schedule EPR Horn non eq is on
% 1.40/1.19
% 1.40/1.19 ------ no conjectures: strip conj schedule
% 1.40/1.19
% 1.40/1.19 ------ no equalities: superposition off
% 1.40/1.19
% 1.40/1.19 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.40/1.19
% 1.40/1.19
% 1.40/1.19
% 1.40/1.19
% 1.40/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.40/1.19
% 1.40/1.19 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.40/1.19
% 1.40/1.19
%------------------------------------------------------------------------------