TSTP Solution File: LCL322-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL322-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:17 EDT 2024
% Result : Unsatisfiable 3.42s 1.16s
% Output : CNFRefutation 3.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(implies(p,q),implies(q,p))),
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,
implies(p,q) = sP0_iProver_def,
definition ).
cnf(c_169,plain,
implies(q,p) = sP1_iProver_def,
definition ).
cnf(c_170,plain,
or(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_171,negated_conjecture,
~ theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_169,c_168,c_170]) ).
cnf(c_296,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_117]) ).
cnf(c_297,plain,
theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_111]) ).
cnf(c_298,plain,
theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_117]) ).
cnf(c_315,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_111,c_57]) ).
cnf(c_317,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_123,c_57]) ).
cnf(c_350,plain,
theorem(implies(q,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_168,c_297]) ).
cnf(c_398,plain,
theorem(implies(implies(X0,sP1_iProver_def),implies(or(sP0_iProver_def,X0),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_170,c_129]) ).
cnf(c_423,plain,
theorem(implies(or(p,not(q)),sP1_iProver_def)),
inference(superposition,[status(thm)],[c_169,c_296]) ).
cnf(c_449,plain,
( ~ theorem(implies(X0,X1))
| theorem(or(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_298,c_57]) ).
cnf(c_589,plain,
( ~ theorem(implies(X0,sP1_iProver_def))
| theorem(implies(or(sP0_iProver_def,X0),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_398,c_57]) ).
cnf(c_852,plain,
( ~ theorem(implies(X0,sP1_iProver_def))
| ~ theorem(or(sP0_iProver_def,X0))
| theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_589,c_57]) ).
cnf(c_853,plain,
( ~ theorem(implies(X0,sP1_iProver_def))
| ~ theorem(or(sP0_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_852,c_171]) ).
cnf(c_864,plain,
~ theorem(or(sP0_iProver_def,or(p,not(q)))),
inference(superposition,[status(thm)],[c_423,c_853]) ).
cnf(c_1090,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_315,c_317]) ).
cnf(c_1530,plain,
~ theorem(or(sP0_iProver_def,not(q))),
inference(superposition,[status(thm)],[c_1090,c_864]) ).
cnf(c_1607,plain,
~ theorem(implies(q,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_449,c_1530]) ).
cnf(c_1608,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1607,c_350]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL322-3 : TPTP v8.2.0. Released v2.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Jun 22 16:25:39 EDT 2024
% 0.13/0.33 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.42/1.16 % SZS status Started for theBenchmark.p
% 3.42/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.42/1.16
% 3.42/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.42/1.16
% 3.42/1.16 ------ iProver source info
% 3.42/1.16
% 3.42/1.16 git: date: 2024-06-12 09:56:46 +0000
% 3.42/1.16 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.42/1.16 git: non_committed_changes: false
% 3.42/1.16
% 3.42/1.16 ------ Parsing...successful
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ 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
% 3.42/1.16
% 3.42/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.42/1.16
% 3.42/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.42/1.16 ------ Proving...
% 3.42/1.16 ------ Problem Properties
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 clauses 11
% 3.42/1.16 conjectures 1
% 3.42/1.16 EPR 1
% 3.42/1.16 Horn 11
% 3.42/1.16 unary 10
% 3.42/1.16 binary 0
% 3.42/1.16 lits 13
% 3.42/1.16 lits eq 4
% 3.42/1.16 fd_pure 0
% 3.42/1.16 fd_pseudo 0
% 3.42/1.16 fd_cond 0
% 3.42/1.16 fd_pseudo_cond 0
% 3.42/1.16 AC symbols 0
% 3.42/1.16
% 3.42/1.16 ------ Schedule dynamic 5 is on
% 3.42/1.16
% 3.42/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------
% 3.42/1.16 Current options:
% 3.42/1.16 ------
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Proving...
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.42/1.16
% 3.42/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.42/1.16
% 3.42/1.16
%------------------------------------------------------------------------------