TSTP Solution File: LCL180-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL180-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:06 EDT 2024
% Result : Unsatisfiable 0.47s 1.15s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(not(not(p)),p)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
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_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(p) = sP0_iProver_def,
definition ).
cnf(c_171,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_172,plain,
implies(sP1_iProver_def,p) = sP2_iProver_def,
definition ).
cnf(c_173,negated_conjecture,
~ theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_170,c_171,c_172]) ).
cnf(c_300,plain,
implies(p,X0) = or(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_170,c_55]) ).
cnf(c_301,plain,
implies(sP0_iProver_def,X0) = or(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_171,c_55]) ).
cnf(c_303,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_118]) ).
cnf(c_312,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_124]) ).
cnf(c_323,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_106,c_57]) ).
cnf(c_325,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_118,c_57]) ).
cnf(c_326,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_124,c_57]) ).
cnf(c_369,plain,
theorem(or(sP0_iProver_def,or(X0,p))),
inference(superposition,[status(thm)],[c_300,c_112]) ).
cnf(c_417,plain,
theorem(implies(or(sP1_iProver_def,X0),implies(or(X1,sP0_iProver_def),or(X1,X0)))),
inference(superposition,[status(thm)],[c_301,c_130]) ).
cnf(c_438,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_303]) ).
cnf(c_441,plain,
theorem(implies(or(p,not(sP1_iProver_def)),sP2_iProver_def)),
inference(superposition,[status(thm)],[c_172,c_303]) ).
cnf(c_461,plain,
( ~ theorem(or(p,not(sP1_iProver_def)))
| theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_441,c_57]) ).
cnf(c_462,plain,
~ theorem(or(p,not(sP1_iProver_def))),
inference(forward_subsumption_resolution,[status(thm)],[c_461,c_173]) ).
cnf(c_563,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_312,c_55]) ).
cnf(c_571,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_563,c_57]) ).
cnf(c_668,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_438,c_57]) ).
cnf(c_1010,plain,
theorem(or(X0,or(sP0_iProver_def,p))),
inference(superposition,[status(thm)],[c_369,c_326]) ).
cnf(c_1099,plain,
theorem(or(sP0_iProver_def,p)),
inference(superposition,[status(thm)],[c_1010,c_323]) ).
cnf(c_1118,plain,
theorem(or(p,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_1099,c_325]) ).
cnf(c_1375,plain,
( ~ theorem(or(sP1_iProver_def,X0))
| theorem(implies(or(X1,sP0_iProver_def),or(X1,X0))) ),
inference(superposition,[status(thm)],[c_417,c_57]) ).
cnf(c_1930,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_112,c_571]) ).
cnf(c_1988,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_1930,c_323]) ).
cnf(c_1996,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_1988,c_668]) ).
cnf(c_2074,plain,
theorem(or(sP1_iProver_def,not(not(sP0_iProver_def)))),
inference(superposition,[status(thm)],[c_301,c_1996]) ).
cnf(c_2081,plain,
theorem(or(sP1_iProver_def,not(sP1_iProver_def))),
inference(light_normalisation,[status(thm)],[c_2074,c_171]) ).
cnf(c_4512,plain,
( ~ theorem(or(X0,sP0_iProver_def))
| ~ theorem(or(sP1_iProver_def,X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1375,c_57]) ).
cnf(c_6845,plain,
( ~ theorem(or(sP1_iProver_def,X0))
| theorem(or(p,X0)) ),
inference(superposition,[status(thm)],[c_1118,c_4512]) ).
cnf(c_8493,plain,
theorem(or(p,not(sP1_iProver_def))),
inference(superposition,[status(thm)],[c_2081,c_6845]) ).
cnf(c_8501,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8493,c_462]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL180-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu May 2 19:42:16 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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
% 0.47/1.15 % SZS status Started for theBenchmark.p
% 0.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.15
% 0.47/1.15 ------ iProver source info
% 0.47/1.15
% 0.47/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.15 git: non_committed_changes: false
% 0.47/1.15
% 0.47/1.15 ------ Parsing...successful
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.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
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.15 ------ Proving...
% 0.47/1.15 ------ Problem Properties
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 clauses 11
% 0.47/1.15 conjectures 1
% 0.47/1.15 EPR 1
% 0.47/1.15 Horn 11
% 0.47/1.15 unary 10
% 0.47/1.15 binary 0
% 0.47/1.15 lits 13
% 0.47/1.15 lits eq 4
% 0.47/1.15 fd_pure 0
% 0.47/1.15 fd_pseudo 0
% 0.47/1.15 fd_cond 0
% 0.47/1.15 fd_pseudo_cond 0
% 0.47/1.15 AC symbols 0
% 0.47/1.15
% 0.47/1.15 ------ Schedule dynamic 5 is on
% 0.47/1.15
% 0.47/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------
% 0.47/1.15 Current options:
% 0.47/1.15 ------
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Proving...
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.15
% 0.47/1.15
%------------------------------------------------------------------------------