TSTP Solution File: LCL208-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL208-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Thu Aug 31 07:43:10 EDT 2023
% Result : Satisfiable 137.60s 19.34s
% Output : Saturation 137.60s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(or(p,q),implies(not(p),q))),
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_96,plain,
( X0 != X1
| ~ axiom(X1)
| axiom(X0) ),
theory(equality) ).
cnf(c_97,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).
cnf(c_98,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_97]) ).
cnf(c_103,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_104,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_103]) ).
cnf(c_109,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_110,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_109]) ).
cnf(c_115,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_116,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_115]) ).
cnf(c_121,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_122,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_121]) ).
cnf(c_160,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_277,plain,
theorem(implies(implies(X0,not(X0)),not(X0))),
inference(superposition,[status(thm)],[c_55,c_98]) ).
cnf(c_278,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_110]) ).
cnf(c_279,plain,
theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_104]) ).
cnf(c_280,plain,
theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_110]) ).
cnf(c_282,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_278]) ).
cnf(c_293,plain,
theorem(implies(or(X0,or(not(X1),X2)),implies(X1,or(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_116]) ).
cnf(c_294,plain,
theorem(implies(or(not(X0),or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_116]) ).
cnf(c_295,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_294,c_55]) ).
cnf(c_296,plain,
theorem(implies(or(X0,implies(X1,X2)),implies(X1,or(X0,X2)))),
inference(demodulation,[status(thm)],[c_293,c_55]) ).
cnf(c_306,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_98,c_57]) ).
cnf(c_307,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_104,c_57]) ).
cnf(c_308,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_110,c_57]) ).
cnf(c_309,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_116,c_57]) ).
cnf(c_310,plain,
( ~ theorem(implies(X0,not(X0)))
| theorem(not(X0)) ),
inference(superposition,[status(thm)],[c_277,c_57]) ).
cnf(c_311,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_278,c_57]) ).
cnf(c_312,plain,
( ~ theorem(X0)
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_279,c_57]) ).
cnf(c_321,plain,
~ theorem(implies(not(p),q)),
inference(superposition,[status(thm)],[c_312,c_49]) ).
cnf(c_324,plain,
~ theorem(q),
inference(superposition,[status(thm)],[c_312,c_321]) ).
cnf(c_328,plain,
( ~ theorem(implies(X0,X1))
| theorem(or(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_280,c_57]) ).
cnf(c_329,plain,
( ~ theorem(X0)
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_307,c_308]) ).
cnf(c_389,plain,
( ~ theorem(not(X0))
| theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_55,c_329]) ).
cnf(c_424,plain,
~ theorem(not(or(p,q))),
inference(superposition,[status(thm)],[c_389,c_49]) ).
cnf(c_425,plain,
( ~ theorem(not(X0))
| ~ theorem(X0)
| theorem(X1) ),
inference(superposition,[status(thm)],[c_389,c_57]) ).
cnf(c_426,plain,
~ theorem(not(not(p))),
inference(superposition,[status(thm)],[c_389,c_321]) ).
cnf(c_566,plain,
theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_55,c_122]) ).
cnf(c_567,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_122,c_57]) ).
cnf(c_568,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_566,c_55]) ).
cnf(c_1342,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_282,c_57]) ).
cnf(c_3857,plain,
( ~ theorem(not(X0))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_389,c_1342]) ).
cnf(c_3859,plain,
theorem(implies(X0,not(implies(X0,not(X0))))),
inference(superposition,[status(thm)],[c_277,c_1342]) ).
cnf(c_3860,plain,
( ~ theorem(not(X0))
| theorem(implies(X0,not(X1))) ),
inference(superposition,[status(thm)],[c_312,c_1342]) ).
cnf(c_7373,plain,
( ~ theorem(X0)
| theorem(not(implies(X0,not(X0)))) ),
inference(superposition,[status(thm)],[c_3859,c_57]) ).
cnf(c_9991,plain,
( ~ theorem(not(X0))
| ~ theorem(X0)
| theorem(not(X1)) ),
inference(superposition,[status(thm)],[c_3860,c_57]) ).
cnf(c_13553,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_295,c_57]) ).
cnf(c_24518,plain,
( ~ theorem(X0)
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_329,c_309]) ).
cnf(c_26662,plain,
( ~ theorem(not(X0))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_389,c_13553]) ).
cnf(c_27861,plain,
( ~ theorem(X0)
| theorem(implies(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_55,c_24518]) ).
cnf(c_27864,plain,
( ~ theorem(X0)
| theorem(or(or(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_24518,c_308]) ).
cnf(c_27865,plain,
( ~ theorem(X0)
| theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_24518,c_309]) ).
cnf(c_28666,plain,
( ~ theorem(not(X0))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_55,c_27861]) ).
cnf(c_28667,plain,
( ~ theorem(X0)
| ~ theorem(X1)
| theorem(or(X0,X2)) ),
inference(superposition,[status(thm)],[c_27861,c_57]) ).
cnf(c_28668,plain,
( ~ theorem(X0)
| theorem(or(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_27861,c_13553]) ).
cnf(c_30178,plain,
( ~ theorem(X0)
| theorem(or(or(X1,X2),X0)) ),
inference(superposition,[status(thm)],[c_27865,c_308]) ).
cnf(c_31481,plain,
( ~ theorem(X0)
| theorem(or(implies(X1,X2),X0)) ),
inference(superposition,[status(thm)],[c_28668,c_308]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL208-3 : TPTP v8.1.2. Released v2.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 17:42:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 137.60/19.34 % SZS status Started for theBenchmark.p
% 137.60/19.34 % SZS status Satisfiable for theBenchmark.p
% 137.60/19.34
% 137.60/19.34 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 137.60/19.34
% 137.60/19.34 ------ iProver source info
% 137.60/19.34
% 137.60/19.34 git: date: 2023-05-31 18:12:56 +0000
% 137.60/19.34 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 137.60/19.34 git: non_committed_changes: false
% 137.60/19.34 git: last_make_outside_of_git: false
% 137.60/19.34
% 137.60/19.34 ------ Parsing...successful
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34 ------ 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
% 137.60/19.34
% 137.60/19.34 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 137.60/19.34
% 137.60/19.34 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 137.60/19.34 ------ Proving...
% 137.60/19.34 ------ Problem Properties
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34 clauses 8
% 137.60/19.34 conjectures 1
% 137.60/19.34 EPR 0
% 137.60/19.34 Horn 8
% 137.60/19.34 unary 7
% 137.60/19.34 binary 0
% 137.60/19.34 lits 10
% 137.60/19.34 lits eq 1
% 137.60/19.34 fd_pure 0
% 137.60/19.34 fd_pseudo 0
% 137.60/19.34 fd_cond 0
% 137.60/19.34 fd_pseudo_cond 0
% 137.60/19.34 AC symbols 0
% 137.60/19.34
% 137.60/19.34 ------ Input Options Time Limit: Unbounded
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34 ------
% 137.60/19.34 Current options:
% 137.60/19.34 ------
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34 ------ Proving...
% 137.60/19.34
% 137.60/19.34
% 137.60/19.34 % SZS status Satisfiable for theBenchmark.p
% 137.60/19.34
% 137.60/19.34 % SZS output start Saturation for theBenchmark.p
% See solution above
% 137.60/19.34
% 137.60/19.35
%------------------------------------------------------------------------------