TSTP Solution File: LCL211-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL211-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:16 EDT 2024
% Result : Unsatisfiable 9.80s 2.15s
% Output : CNFRefutation 9.80s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(not(q),implies(or(p,q),p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_105,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).
cnf(c_106,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_105]) ).
cnf(c_111,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_112,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_111]) ).
cnf(c_117,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_118,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_117]) ).
cnf(c_123,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_124,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_123]) ).
cnf(c_129,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_130,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_129]) ).
cnf(c_170,plain,
not(q) = sP0_iProver_def,
definition ).
cnf(c_171,plain,
or(p,q) = sP1_iProver_def,
definition ).
cnf(c_172,plain,
implies(sP1_iProver_def,p) = sP2_iProver_def,
definition ).
cnf(c_173,plain,
implies(sP0_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_174,negated_conjecture,
~ theorem(sP3_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_171,c_172,c_170,c_173]) ).
cnf(c_306,plain,
theorem(implies(sP1_iProver_def,or(q,p))),
inference(superposition,[status(thm)],[c_171,c_118]) ).
cnf(c_308,plain,
or(sP0_iProver_def,X0) = implies(q,X0),
inference(superposition,[status(thm)],[c_170,c_55]) ).
cnf(c_310,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_118]) ).
cnf(c_322,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_106,c_57]) ).
cnf(c_324,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_118,c_57]) ).
cnf(c_401,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_124]) ).
cnf(c_454,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_310]) ).
cnf(c_457,plain,
theorem(implies(or(sP2_iProver_def,not(sP0_iProver_def)),sP3_iProver_def)),
inference(superposition,[status(thm)],[c_173,c_310]) ).
cnf(c_477,plain,
( ~ theorem(or(sP2_iProver_def,not(sP0_iProver_def)))
| theorem(sP3_iProver_def) ),
inference(superposition,[status(thm)],[c_457,c_57]) ).
cnf(c_478,plain,
~ theorem(or(sP2_iProver_def,not(sP0_iProver_def))),
inference(forward_subsumption_resolution,[status(thm)],[c_477,c_174]) ).
cnf(c_508,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_130,c_57]) ).
cnf(c_659,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_401,c_55]) ).
cnf(c_664,plain,
theorem(implies(implies(sP1_iProver_def,or(X0,p)),or(X0,sP2_iProver_def))),
inference(superposition,[status(thm)],[c_172,c_659]) ).
cnf(c_667,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_659,c_57]) ).
cnf(c_727,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_454,c_57]) ).
cnf(c_882,plain,
( ~ theorem(implies(sP1_iProver_def,or(X0,p)))
| theorem(or(X0,sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_664,c_57]) ).
cnf(c_1794,plain,
( ~ theorem(or(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(or(X0,X2)) ),
inference(superposition,[status(thm)],[c_508,c_57]) ).
cnf(c_1816,plain,
theorem(or(q,sP2_iProver_def)),
inference(superposition,[status(thm)],[c_306,c_882]) ).
cnf(c_1867,plain,
theorem(or(sP2_iProver_def,q)),
inference(superposition,[status(thm)],[c_1816,c_324]) ).
cnf(c_2476,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_112,c_667]) ).
cnf(c_2794,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_2476,c_322]) ).
cnf(c_2803,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_2794,c_727]) ).
cnf(c_2932,plain,
theorem(or(sP0_iProver_def,not(not(q)))),
inference(superposition,[status(thm)],[c_308,c_2803]) ).
cnf(c_2938,plain,
theorem(or(sP0_iProver_def,not(sP0_iProver_def))),
inference(light_normalisation,[status(thm)],[c_2932,c_170]) ).
cnf(c_6834,plain,
( ~ theorem(implies(q,X0))
| theorem(or(sP2_iProver_def,X0)) ),
inference(superposition,[status(thm)],[c_1867,c_1794]) ).
cnf(c_6917,plain,
( ~ theorem(or(sP0_iProver_def,X0))
| theorem(or(sP2_iProver_def,X0)) ),
inference(light_normalisation,[status(thm)],[c_6834,c_308]) ).
cnf(c_17012,plain,
theorem(or(sP2_iProver_def,not(sP0_iProver_def))),
inference(superposition,[status(thm)],[c_2938,c_6917]) ).
cnf(c_17046,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_17012,c_478]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL211-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 18:49:04 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 9.80/2.15 % SZS status Started for theBenchmark.p
% 9.80/2.15 % SZS status Unsatisfiable for theBenchmark.p
% 9.80/2.15
% 9.80/2.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 9.80/2.15
% 9.80/2.15 ------ iProver source info
% 9.80/2.15
% 9.80/2.15 git: date: 2024-05-02 19:28:25 +0000
% 9.80/2.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 9.80/2.15 git: non_committed_changes: false
% 9.80/2.15
% 9.80/2.15 ------ Parsing...successful
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15 ------ 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
% 9.80/2.15
% 9.80/2.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.80/2.15
% 9.80/2.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.80/2.15 ------ Proving...
% 9.80/2.15 ------ Problem Properties
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15 clauses 12
% 9.80/2.15 conjectures 1
% 9.80/2.15 EPR 1
% 9.80/2.15 Horn 12
% 9.80/2.15 unary 11
% 9.80/2.15 binary 0
% 9.80/2.15 lits 14
% 9.80/2.15 lits eq 5
% 9.80/2.15 fd_pure 0
% 9.80/2.15 fd_pseudo 0
% 9.80/2.15 fd_cond 0
% 9.80/2.15 fd_pseudo_cond 0
% 9.80/2.15 AC symbols 0
% 9.80/2.15
% 9.80/2.15 ------ Schedule dynamic 5 is on
% 9.80/2.15
% 9.80/2.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15 ------
% 9.80/2.15 Current options:
% 9.80/2.15 ------
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15 ------ Proving...
% 9.80/2.15
% 9.80/2.15
% 9.80/2.15 % SZS status Unsatisfiable for theBenchmark.p
% 9.80/2.15
% 9.80/2.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.80/2.15
% 9.80/2.15
%------------------------------------------------------------------------------