TSTP Solution File: LCL218-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL218-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Fri May 3 02:37:19 EDT 2024
% Result : Unsatisfiable 8.39s 1.71s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(implies(or(p,q),q),implies(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_110,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_111,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_110]) ).
cnf(c_116,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_117,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_116]) ).
cnf(c_122,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_53,c_56]) ).
cnf(c_123,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_122]) ).
cnf(c_128,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_56]) ).
cnf(c_129,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_128]) ).
cnf(c_168,plain,
or(p,q) = sP0_iProver_def,
definition ).
cnf(c_169,plain,
implies(sP0_iProver_def,q) = sP1_iProver_def,
definition ).
cnf(c_170,plain,
implies(p,q) = sP2_iProver_def,
definition ).
cnf(c_171,plain,
implies(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_172,negated_conjecture,
~ theorem(sP3_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_170,c_168,c_169,c_171]) ).
cnf(c_295,plain,
theorem(implies(or(q,p),sP0_iProver_def)),
inference(superposition,[status(thm)],[c_168,c_117]) ).
cnf(c_396,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_123]) ).
cnf(c_497,plain,
theorem(implies(sP1_iProver_def,implies(or(X0,sP0_iProver_def),or(X0,q)))),
inference(superposition,[status(thm)],[c_169,c_129]) ).
cnf(c_500,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))),
inference(superposition,[status(thm)],[c_55,c_129]) ).
cnf(c_679,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_396,c_55]) ).
cnf(c_681,plain,
theorem(implies(implies(X0,implies(X1,X2)),or(not(X1),implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_679]) ).
cnf(c_722,plain,
theorem(implies(sP1_iProver_def,implies(implies(X0,sP0_iProver_def),or(not(X0),q)))),
inference(superposition,[status(thm)],[c_55,c_497]) ).
cnf(c_1346,plain,
theorem(implies(sP1_iProver_def,implies(implies(X0,sP0_iProver_def),implies(X0,q)))),
inference(demodulation,[status(thm)],[c_722,c_55]) ).
cnf(c_1494,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_500,c_55]) ).
cnf(c_1501,plain,
theorem(implies(implies(X0,q),implies(implies(p,X0),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_170,c_1494]) ).
cnf(c_1503,plain,
theorem(implies(implies(X0,sP2_iProver_def),implies(implies(sP1_iProver_def,X0),sP3_iProver_def))),
inference(superposition,[status(thm)],[c_171,c_1494]) ).
cnf(c_1755,plain,
( ~ theorem(implies(X0,sP2_iProver_def))
| theorem(implies(implies(sP1_iProver_def,X0),sP3_iProver_def)) ),
inference(superposition,[status(thm)],[c_1503,c_57]) ).
cnf(c_1953,plain,
theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_681,c_55]) ).
cnf(c_1960,plain,
( ~ theorem(implies(X0,implies(X1,X2)))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_1953,c_57]) ).
cnf(c_4332,plain,
( ~ theorem(implies(X0,sP2_iProver_def))
| ~ theorem(implies(sP1_iProver_def,X0))
| theorem(sP3_iProver_def) ),
inference(superposition,[status(thm)],[c_1755,c_57]) ).
cnf(c_4333,plain,
( ~ theorem(implies(X0,sP2_iProver_def))
| ~ theorem(implies(sP1_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4332,c_172]) ).
cnf(c_7992,plain,
theorem(implies(implies(X0,sP0_iProver_def),implies(sP1_iProver_def,implies(X0,q)))),
inference(superposition,[status(thm)],[c_1346,c_1960]) ).
cnf(c_8001,plain,
theorem(implies(implies(p,X0),implies(implies(X0,q),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_1501,c_1960]) ).
cnf(c_13530,plain,
( ~ theorem(implies(X0,sP0_iProver_def))
| theorem(implies(sP1_iProver_def,implies(X0,q))) ),
inference(superposition,[status(thm)],[c_7992,c_57]) ).
cnf(c_13806,plain,
( ~ theorem(implies(p,X0))
| theorem(implies(implies(X0,q),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_8001,c_57]) ).
cnf(c_14689,plain,
( ~ theorem(implies(sP1_iProver_def,implies(X0,q)))
| ~ theorem(implies(p,X0)) ),
inference(superposition,[status(thm)],[c_13806,c_4333]) ).
cnf(c_14769,plain,
( ~ theorem(implies(X0,sP0_iProver_def))
| ~ theorem(implies(p,X0)) ),
inference(superposition,[status(thm)],[c_13530,c_14689]) ).
cnf(c_14843,plain,
~ theorem(implies(p,or(q,p))),
inference(superposition,[status(thm)],[c_295,c_14769]) ).
cnf(c_14857,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_14843,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL218-3 : TPTP v8.1.2. Released v2.3.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 19:35:18 EDT 2024
% 0.13/0.35 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.39/1.71 % SZS status Started for theBenchmark.p
% 8.39/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 8.39/1.71
% 8.39/1.71 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.39/1.71
% 8.39/1.71 ------ iProver source info
% 8.39/1.71
% 8.39/1.71 git: date: 2024-05-02 19:28:25 +0000
% 8.39/1.71 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.39/1.71 git: non_committed_changes: false
% 8.39/1.71
% 8.39/1.71 ------ Parsing...successful
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 8.39/1.71
% 8.39/1.71 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.39/1.71
% 8.39/1.71 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.39/1.71 ------ Proving...
% 8.39/1.71 ------ Problem Properties
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71 clauses 12
% 8.39/1.71 conjectures 1
% 8.39/1.71 EPR 1
% 8.39/1.71 Horn 12
% 8.39/1.71 unary 11
% 8.39/1.71 binary 0
% 8.39/1.71 lits 14
% 8.39/1.71 lits eq 5
% 8.39/1.71 fd_pure 0
% 8.39/1.71 fd_pseudo 0
% 8.39/1.71 fd_cond 0
% 8.39/1.71 fd_pseudo_cond 0
% 8.39/1.71 AC symbols 0
% 8.39/1.71
% 8.39/1.71 ------ Schedule dynamic 5 is on
% 8.39/1.71
% 8.39/1.71 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71 ------
% 8.39/1.71 Current options:
% 8.39/1.71 ------
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71 ------ Proving...
% 8.39/1.71
% 8.39/1.71
% 8.39/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 8.39/1.71
% 8.39/1.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.39/1.71
% 8.39/1.71
%------------------------------------------------------------------------------