TSTP Solution File: LCL199-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL199-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:13 EDT 2024
% Result : Unsatisfiable 13.40s 2.61s
% Output : CNFRefutation 13.40s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(not(or(p,q)),not(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,
or(p,q) = sP0_iProver_def,
definition ).
cnf(c_171,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_172,plain,
not(p) = sP2_iProver_def,
definition ).
cnf(c_173,plain,
implies(sP1_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_172,c_170,c_171,c_173]) ).
cnf(c_307,plain,
theorem(implies(or(q,p),sP0_iProver_def)),
inference(superposition,[status(thm)],[c_170,c_118]) ).
cnf(c_308,plain,
or(sP2_iProver_def,X0) = implies(p,X0),
inference(superposition,[status(thm)],[c_172,c_55]) ).
cnf(c_309,plain,
or(sP1_iProver_def,X0) = implies(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_171,c_55]) ).
cnf(c_311,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_118]) ).
cnf(c_323,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_106,c_57]) ).
cnf(c_389,plain,
theorem(or(sP2_iProver_def,or(X0,p))),
inference(superposition,[status(thm)],[c_308,c_112]) ).
cnf(c_412,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_124]) ).
cnf(c_472,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_311]) ).
cnf(c_475,plain,
theorem(implies(or(sP2_iProver_def,not(sP1_iProver_def)),sP3_iProver_def)),
inference(superposition,[status(thm)],[c_173,c_311]) ).
cnf(c_487,plain,
( ~ theorem(or(sP2_iProver_def,not(sP1_iProver_def)))
| theorem(sP3_iProver_def) ),
inference(superposition,[status(thm)],[c_475,c_57]) ).
cnf(c_488,plain,
~ theorem(or(sP2_iProver_def,not(sP1_iProver_def))),
inference(forward_subsumption_resolution,[status(thm)],[c_487,c_174]) ).
cnf(c_552,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))),
inference(superposition,[status(thm)],[c_55,c_130]) ).
cnf(c_555,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_130,c_57]) ).
cnf(c_684,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_412,c_55]) ).
cnf(c_693,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_684,c_57]) ).
cnf(c_791,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_472,c_57]) ).
cnf(c_1752,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_552,c_55]) ).
cnf(c_1755,plain,
theorem(implies(or(sP1_iProver_def,X0),implies(implies(X1,sP0_iProver_def),implies(X1,X0)))),
inference(superposition,[status(thm)],[c_309,c_1752]) ).
cnf(c_2137,plain,
( ~ theorem(or(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(or(X0,X2)) ),
inference(superposition,[status(thm)],[c_555,c_57]) ).
cnf(c_2795,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_112,c_693]) ).
cnf(c_3062,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_2795,c_323]) ).
cnf(c_3073,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_3062,c_791]) ).
cnf(c_3105,plain,
theorem(or(sP1_iProver_def,not(not(sP0_iProver_def)))),
inference(superposition,[status(thm)],[c_309,c_3073]) ).
cnf(c_3111,plain,
theorem(or(sP1_iProver_def,not(sP1_iProver_def))),
inference(light_normalisation,[status(thm)],[c_3105,c_171]) ).
cnf(c_5786,plain,
( ~ theorem(or(sP1_iProver_def,X0))
| theorem(implies(implies(X1,sP0_iProver_def),implies(X1,X0))) ),
inference(superposition,[status(thm)],[c_1755,c_57]) ).
cnf(c_8044,plain,
( ~ theorem(or(sP1_iProver_def,X0))
| ~ theorem(implies(X1,sP0_iProver_def))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_5786,c_57]) ).
cnf(c_8143,plain,
( ~ theorem(implies(or(X0,p),X1))
| theorem(or(sP2_iProver_def,X1)) ),
inference(superposition,[status(thm)],[c_389,c_2137]) ).
cnf(c_10711,plain,
( ~ theorem(implies(X0,sP0_iProver_def))
| theorem(implies(X0,not(sP1_iProver_def))) ),
inference(superposition,[status(thm)],[c_3111,c_8044]) ).
cnf(c_14701,plain,
( ~ theorem(implies(p,sP0_iProver_def))
| theorem(or(sP2_iProver_def,not(sP1_iProver_def))) ),
inference(superposition,[status(thm)],[c_308,c_10711]) ).
cnf(c_14729,plain,
~ theorem(implies(p,sP0_iProver_def)),
inference(forward_subsumption_resolution,[status(thm)],[c_14701,c_488]) ).
cnf(c_14750,plain,
~ theorem(or(sP2_iProver_def,sP0_iProver_def)),
inference(demodulation,[status(thm)],[c_14729,c_308]) ).
cnf(c_27299,plain,
theorem(or(sP2_iProver_def,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_307,c_8143]) ).
cnf(c_27379,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_27299,c_14750]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL199-3 : TPTP v8.1.2. Released v2.3.0.
% 0.05/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n023.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 19:08:24 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 13.40/2.61 % SZS status Started for theBenchmark.p
% 13.40/2.61 % SZS status Unsatisfiable for theBenchmark.p
% 13.40/2.61
% 13.40/2.61 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 13.40/2.61
% 13.40/2.61 ------ iProver source info
% 13.40/2.61
% 13.40/2.61 git: date: 2024-05-02 19:28:25 +0000
% 13.40/2.61 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 13.40/2.61 git: non_committed_changes: false
% 13.40/2.61
% 13.40/2.61 ------ Parsing...successful
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61 ------ 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
% 13.40/2.61
% 13.40/2.61 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 13.40/2.61
% 13.40/2.61 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 13.40/2.61 ------ Proving...
% 13.40/2.61 ------ Problem Properties
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61 clauses 12
% 13.40/2.61 conjectures 1
% 13.40/2.61 EPR 1
% 13.40/2.61 Horn 12
% 13.40/2.61 unary 11
% 13.40/2.61 binary 0
% 13.40/2.61 lits 14
% 13.40/2.61 lits eq 5
% 13.40/2.61 fd_pure 0
% 13.40/2.61 fd_pseudo 0
% 13.40/2.61 fd_cond 0
% 13.40/2.61 fd_pseudo_cond 0
% 13.40/2.61 AC symbols 0
% 13.40/2.61
% 13.40/2.61 ------ Schedule dynamic 5 is on
% 13.40/2.61
% 13.40/2.61 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61 ------
% 13.40/2.61 Current options:
% 13.40/2.61 ------
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61 ------ Proving...
% 13.40/2.61
% 13.40/2.61
% 13.40/2.61 % SZS status Unsatisfiable for theBenchmark.p
% 13.40/2.61
% 13.40/2.61 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.40/2.62
% 13.40/2.62
%------------------------------------------------------------------------------