TSTP Solution File: LCL250-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL250-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Mon Jun 24 11:05:02 EDT 2024
% Result : Unsatisfiable 133.99s 18.75s
% Output : CNFRefutation 133.99s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_216,plain,
not(q) = sP0_iProver_def,
definition ).
cnf(c_217,plain,
or(sP0_iProver_def,r) = sP1_iProver_def,
definition ).
cnf(c_218,plain,
not(sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_219,plain,
not(p) = sP3_iProver_def,
definition ).
cnf(c_220,plain,
or(sP3_iProver_def,sP0_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_221,plain,
not(sP4_iProver_def) = sP5_iProver_def,
definition ).
cnf(c_222,plain,
not(sP5_iProver_def) = sP6_iProver_def,
definition ).
cnf(c_223,plain,
or(sP6_iProver_def,r) = sP7_iProver_def,
definition ).
cnf(c_224,plain,
or(sP2_iProver_def,sP7_iProver_def) = sP8_iProver_def,
definition ).
cnf(c_225,negated_conjecture,
~ theorem(sP8_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_219,c_220,c_221,c_222,c_223,c_216,c_217,c_218,c_224]) ).
cnf(c_429,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_442,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_443,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_444,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_504,plain,
axiom(or(not(or(sP6_iProver_def,or(X0,r))),or(X0,sP7_iProver_def))),
inference(superposition,[status(thm)],[c_223,c_53]) ).
cnf(c_507,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_549,plain,
axiom(or(not(or(sP5_iProver_def,X0)),or(not(or(X1,sP4_iProver_def)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_221,c_54]) ).
cnf(c_810,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| theorem(or(not(X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_429,c_57]) ).
cnf(c_1085,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_443,c_507]) ).
cnf(c_2096,plain,
( ~ theorem(or(sP6_iProver_def,or(X0,r)))
| theorem(or(X0,sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_504,c_56]) ).
cnf(c_2954,plain,
( ~ theorem(or(X0,r))
| theorem(or(X0,sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_223,c_1085]) ).
cnf(c_2957,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1085,c_442]) ).
cnf(c_2958,plain,
( ~ theorem(or(X0,X1))
| theorem(or(or(X2,X1),X0)) ),
inference(superposition,[status(thm)],[c_1085,c_444]) ).
cnf(c_5937,plain,
( ~ theorem(or(or(X0,or(X1,X2)),X2))
| theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_1085,c_2957]) ).
cnf(c_6329,plain,
( ~ theorem(or(r,X0))
| theorem(or(or(X1,X0),sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_2958,c_2954]) ).
cnf(c_21193,plain,
( ~ theorem(or(r,or(X0,sP7_iProver_def)))
| theorem(or(X1,or(X0,sP7_iProver_def))) ),
inference(superposition,[status(thm)],[c_6329,c_5937]) ).
cnf(c_25664,plain,
( ~ theorem(or(sP5_iProver_def,X0))
| theorem(or(not(or(X1,sP4_iProver_def)),or(X1,X0))) ),
inference(superposition,[status(thm)],[c_549,c_56]) ).
cnf(c_26125,plain,
( ~ theorem(or(sP5_iProver_def,X0))
| theorem(or(X1,or(not(or(X1,sP4_iProver_def)),X0))) ),
inference(superposition,[status(thm)],[c_25664,c_507]) ).
cnf(c_26243,plain,
theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_51,c_810]) ).
cnf(c_26552,plain,
theorem(or(sP6_iProver_def,or(sP5_iProver_def,X0))),
inference(superposition,[status(thm)],[c_222,c_26243]) ).
cnf(c_26769,plain,
theorem(or(sP5_iProver_def,sP7_iProver_def)),
inference(superposition,[status(thm)],[c_26552,c_2096]) ).
cnf(c_299552,plain,
( ~ theorem(or(sP5_iProver_def,sP7_iProver_def))
| theorem(or(X0,or(not(or(r,sP4_iProver_def)),sP7_iProver_def))) ),
inference(superposition,[status(thm)],[c_26125,c_21193]) ).
cnf(c_299560,plain,
theorem(or(X0,or(not(or(r,sP4_iProver_def)),sP7_iProver_def))),
inference(forward_subsumption_resolution,[status(thm)],[c_299552,c_26769]) ).
cnf(c_299681,plain,
theorem(or(not(or(r,sP4_iProver_def)),sP7_iProver_def)),
inference(superposition,[status(thm)],[c_299560,c_442]) ).
cnf(c_299710,plain,
theorem(or(sP7_iProver_def,not(or(r,sP4_iProver_def)))),
inference(superposition,[status(thm)],[c_299681,c_444]) ).
cnf(c_311478,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_311479,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_311480,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_311521,plain,
axiom(or(not(or(sP3_iProver_def,or(X0,sP0_iProver_def))),or(X0,sP4_iProver_def))),
inference(superposition,[status(thm)],[c_220,c_53]) ).
cnf(c_311525,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_311551,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_311818,plain,
( ~ theorem(X0)
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_311479,c_311480]) ).
cnf(c_311993,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_311479,c_311525]) ).
cnf(c_312284,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(or(X2,X1),not(or(X2,X0)))) ),
inference(superposition,[status(thm)],[c_311551,c_311480]) ).
cnf(c_313674,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_311993,c_311478]) ).
cnf(c_313675,plain,
( ~ theorem(or(X0,X1))
| theorem(or(or(X2,X1),X0)) ),
inference(superposition,[status(thm)],[c_311993,c_311480]) ).
cnf(c_316429,plain,
( ~ theorem(or(X0,r))
| theorem(or(sP7_iProver_def,X0)) ),
inference(superposition,[status(thm)],[c_223,c_313675]) ).
cnf(c_316711,plain,
( ~ theorem(or(r,X0))
| theorem(or(sP7_iProver_def,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_313675,c_316429]) ).
cnf(c_318458,plain,
( ~ theorem(or(not(X0),not(or(X1,X0))))
| theorem(or(X1,not(or(X1,X0)))) ),
inference(superposition,[status(thm)],[c_312284,c_313674]) ).
cnf(c_318748,plain,
( ~ theorem(or(r,X0))
| theorem(or(X1,or(sP7_iProver_def,X0))) ),
inference(superposition,[status(thm)],[c_316711,c_311525]) ).
cnf(c_321451,plain,
( ~ theorem(or(r,X0))
| theorem(or(sP7_iProver_def,X0)) ),
inference(superposition,[status(thm)],[c_318748,c_311478]) ).
cnf(c_338838,plain,
( ~ theorem(or(sP5_iProver_def,not(or(X0,sP4_iProver_def))))
| theorem(or(X0,not(or(X0,sP4_iProver_def)))) ),
inference(superposition,[status(thm)],[c_221,c_318458]) ).
cnf(c_429551,plain,
( ~ theorem(sP5_iProver_def)
| theorem(or(X0,not(or(X0,sP4_iProver_def)))) ),
inference(superposition,[status(thm)],[c_311818,c_338838]) ).
cnf(c_475568,plain,
( ~ theorem(sP5_iProver_def)
| theorem(or(sP7_iProver_def,not(or(r,sP4_iProver_def)))) ),
inference(superposition,[status(thm)],[c_429551,c_321451]) ).
cnf(c_483470,plain,
theorem(or(sP7_iProver_def,not(or(r,sP4_iProver_def)))),
inference(global_subsumption_just,[status(thm)],[c_475568,c_299710]) ).
cnf(c_483472,plain,
theorem(or(not(or(r,sP4_iProver_def)),sP7_iProver_def)),
inference(superposition,[status(thm)],[c_483470,c_311480]) ).
cnf(c_483474,plain,
( ~ axiom(or(not(X0),or(r,sP4_iProver_def)))
| theorem(or(not(X0),sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_483472,c_57]) ).
cnf(c_485020,plain,
theorem(or(not(or(sP3_iProver_def,or(r,sP0_iProver_def))),sP7_iProver_def)),
inference(superposition,[status(thm)],[c_311521,c_483474]) ).
cnf(c_485084,plain,
( ~ axiom(or(not(X0),or(sP3_iProver_def,or(r,sP0_iProver_def))))
| theorem(or(not(X0),sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_485020,c_57]) ).
cnf(c_513383,plain,
theorem(or(not(or(r,sP0_iProver_def)),sP7_iProver_def)),
inference(superposition,[status(thm)],[c_51,c_485084]) ).
cnf(c_513410,plain,
( ~ axiom(or(not(X0),or(r,sP0_iProver_def)))
| theorem(or(not(X0),sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_513383,c_57]) ).
cnf(c_514758,plain,
theorem(or(not(or(sP0_iProver_def,r)),sP7_iProver_def)),
inference(superposition,[status(thm)],[c_52,c_513410]) ).
cnf(c_514764,plain,
theorem(sP8_iProver_def),
inference(light_normalisation,[status(thm)],[c_514758,c_217,c_218,c_224]) ).
cnf(c_514765,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_514764,c_225]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL250-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 13:20:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.44 Running first-order theorem proving
% 0.19/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 133.99/18.75 % SZS status Started for theBenchmark.p
% 133.99/18.75 % SZS status Unsatisfiable for theBenchmark.p
% 133.99/18.75
% 133.99/18.75 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 133.99/18.75
% 133.99/18.75 ------ iProver source info
% 133.99/18.75
% 133.99/18.75 git: date: 2024-06-12 09:56:46 +0000
% 133.99/18.75 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 133.99/18.75 git: non_committed_changes: false
% 133.99/18.75
% 133.99/18.75 ------ Parsing...successful
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 133.99/18.75
% 133.99/18.75 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 133.99/18.75
% 133.99/18.75 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 133.99/18.75 ------ Proving...
% 133.99/18.75 ------ Problem Properties
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 clauses 18
% 133.99/18.75 conjectures 1
% 133.99/18.75 EPR 2
% 133.99/18.75 Horn 18
% 133.99/18.75 unary 15
% 133.99/18.75 binary 1
% 133.99/18.75 lits 23
% 133.99/18.75 lits eq 9
% 133.99/18.75 fd_pure 0
% 133.99/18.75 fd_pseudo 0
% 133.99/18.75 fd_cond 0
% 133.99/18.75 fd_pseudo_cond 0
% 133.99/18.75 AC symbols 0
% 133.99/18.75
% 133.99/18.75 ------ Schedule dynamic 5 is on
% 133.99/18.75
% 133.99/18.75 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 ------
% 133.99/18.75 Current options:
% 133.99/18.75 ------
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 ------ Proving...
% 133.99/18.75 Proof_search_loop: time out after: 13708 full_loop iterations
% 133.99/18.75
% 133.99/18.75 ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 ------
% 133.99/18.75 Current options:
% 133.99/18.75 ------
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 ------ Proving...
% 133.99/18.75
% 133.99/18.75
% 133.99/18.75 % SZS status Unsatisfiable for theBenchmark.p
% 133.99/18.75
% 133.99/18.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 133.99/18.75
% 133.99/18.75
%------------------------------------------------------------------------------