TSTP Solution File: LCL218-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL218-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:15 EDT 2023
% Result : Unsatisfiable 3.70s 1.16s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 39 ( 18 unt; 0 nHn; 29 RR)
% Number of literals : 77 ( 0 equ; 39 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_218,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| theorem(or(not(or(X0,X1)),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_221,plain,
( ~ axiom(or(not(or(not(or(p,q)),q)),X0))
| ~ theorem(or(not(X0),or(not(p),q)))
| theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_223,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_241,plain,
axiom(or(not(or(not(X0),X1)),or(X1,not(X0)))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_244,plain,
( ~ axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2))))
| ~ theorem(or(not(X0),or(X1,X2)))
| theorem(or(X1,or(not(X0),X2))) ),
inference(instantiation,[status(thm)],[c_223]) ).
cnf(c_245,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_280,plain,
axiom(or(not(or(not(or(p,q)),q)),or(q,not(or(p,q))))),
inference(instantiation,[status(thm)],[c_241]) ).
cnf(c_281,plain,
( ~ axiom(or(not(or(not(or(p,q)),q)),or(q,not(or(p,q)))))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(p),q)))
| theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_221]) ).
cnf(c_322,plain,
( ~ axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q))))
| ~ theorem(or(not(p),or(not(or(q,not(or(p,q)))),q)))
| theorem(or(not(or(q,not(or(p,q)))),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_244]) ).
cnf(c_362,plain,
axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_453,plain,
axiom(or(not(p),or(X0,p))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_455,plain,
axiom(or(not(p),or(q,p))),
inference(instantiation,[status(thm)],[c_453]) ).
cnf(c_467,plain,
( ~ theorem(or(not(X0),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(p),X0))
| theorem(or(not(p),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_499,plain,
axiom(or(not(or(not(X0),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(X0),q)))),
inference(instantiation,[status(thm)],[c_245]) ).
cnf(c_806,plain,
( ~ theorem(or(not(X0),or(not(X1),X2)))
| ~ axiom(or(not(X3),X0))
| theorem(or(not(X3),or(not(X1),X2))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_814,plain,
( ~ axiom(or(not(or(X0,not(X1))),or(not(X1),X0)))
| theorem(or(not(or(X0,not(X1))),or(not(X1),X0))) ),
inference(instantiation,[status(thm)],[c_218]) ).
cnf(c_833,plain,
( ~ axiom(or(not(or(not(X0),or(not(X1),X2))),or(not(X1),or(not(X0),X2))))
| ~ theorem(or(not(X0),or(not(X1),X2)))
| theorem(or(not(X1),or(not(X0),X2))) ),
inference(instantiation,[status(thm)],[c_244]) ).
cnf(c_1032,plain,
( ~ theorem(or(not(or(X0,p)),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(p),or(X0,p)))
| theorem(or(not(p),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_467]) ).
cnf(c_1033,plain,
( ~ theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(p),or(q,p)))
| theorem(or(not(p),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_1032]) ).
cnf(c_1517,plain,
( ~ theorem(or(not(or(X0,X1)),or(not(X2),X3)))
| ~ axiom(or(not(or(X1,X0)),or(X0,X1)))
| theorem(or(not(or(X1,X0)),or(not(X2),X3))) ),
inference(instantiation,[status(thm)],[c_806]) ).
cnf(c_1737,plain,
( ~ axiom(or(not(or(not(or(X0,not(X1))),or(not(X1),X0))),or(not(X1),or(not(or(X0,not(X1))),X0))))
| ~ theorem(or(not(or(X0,not(X1))),or(not(X1),X0)))
| theorem(or(not(X1),or(not(or(X0,not(X1))),X0))) ),
inference(instantiation,[status(thm)],[c_833]) ).
cnf(c_2389,plain,
axiom(or(not(or(not(p),or(X0,X1))),or(X0,or(not(p),X1)))),
inference(instantiation,[status(thm)],[c_245]) ).
cnf(c_2930,plain,
axiom(or(not(or(X0,p)),or(p,X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_2932,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(instantiation,[status(thm)],[c_2930]) ).
cnf(c_3342,plain,
axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),
inference(instantiation,[status(thm)],[c_362]) ).
cnf(c_3468,plain,
( ~ axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_814]) ).
cnf(c_4735,plain,
( ~ theorem(or(not(or(p,X0)),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(or(X0,p)),or(p,X0)))
| theorem(or(not(or(X0,p)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_1517]) ).
cnf(c_4736,plain,
( ~ theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(or(q,p)),or(p,q)))
| theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_4735]) ).
cnf(c_5436,plain,
( ~ axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q))))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_1737]) ).
cnf(c_5437,plain,
axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))),
inference(instantiation,[status(thm)],[c_499]) ).
cnf(c_10600,plain,
axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q)))),
inference(instantiation,[status(thm)],[c_2389]) ).
cnf(c_10601,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10600,c_5437,c_5436,c_4736,c_3468,c_3342,c_2932,c_1033,c_455,c_322,c_281,c_280,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL218-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 25 04:09:08 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.70/1.16 % SZS status Started for theBenchmark.p
% 3.70/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.70/1.16
% 3.70/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.70/1.16
% 3.70/1.16 ------ iProver source info
% 3.70/1.16
% 3.70/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.70/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.70/1.16 git: non_committed_changes: false
% 3.70/1.16 git: last_make_outside_of_git: false
% 3.70/1.16
% 3.70/1.16 ------ Parsing...successful
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.70/1.16
% 3.70/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.70/1.16 ------ Proving...
% 3.70/1.16 ------ Problem Properties
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16 clauses 9
% 3.70/1.16 conjectures 1
% 3.70/1.16 EPR 1
% 3.70/1.16 Horn 9
% 3.70/1.16 unary 6
% 3.70/1.16 binary 1
% 3.70/1.16 lits 14
% 3.70/1.16 lits eq 0
% 3.70/1.16 fd_pure 0
% 3.70/1.16 fd_pseudo 0
% 3.70/1.16 fd_cond 0
% 3.70/1.16 fd_pseudo_cond 0
% 3.70/1.16 AC symbols 0
% 3.70/1.16
% 3.70/1.16 ------ Schedule dynamic 5 is on
% 3.70/1.16
% 3.70/1.16 ------ no equalities: superposition off
% 3.70/1.16
% 3.70/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16 ------
% 3.70/1.16 Current options:
% 3.70/1.16 ------
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16 ------ Proving...
% 3.70/1.16
% 3.70/1.16
% 3.70/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.70/1.16
% 3.70/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/1.16
% 3.70/1.17
%------------------------------------------------------------------------------