TSTP Solution File: LCL208-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL208-1 : TPTP v8.1.2. Released v1.1.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 : Unsatisfiable 24.53s 4.23s
% Output : CNFRefutation 24.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 51 ( 20 unt; 0 nHn; 36 RR)
% Number of literals : 100 ( 0 equ; 50 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 86 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/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/sandbox2/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_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_230,plain,
axiom(or(not(or(p,q)),or(q,p))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_245,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_246,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_274,plain,
( ~ axiom(or(not(or(X0,or(not(X1),X2))),X3))
| ~ theorem(or(X0,or(not(X1),X2)))
| theorem(X3) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_332,plain,
( ~ axiom(or(not(or(not(not(p)),or(not(X0),q))),or(not(X0),or(not(not(p)),q))))
| ~ theorem(or(not(not(p)),or(not(X0),q)))
| theorem(or(not(X0),or(not(not(p)),q))) ),
inference(instantiation,[status(thm)],[c_245]) ).
cnf(c_333,plain,
( ~ axiom(or(not(or(not(not(p)),or(not(p),q))),or(not(p),or(not(not(p)),q))))
| ~ theorem(or(not(not(p)),or(not(p),q)))
| theorem(or(not(p),or(not(not(p)),q))) ),
inference(instantiation,[status(thm)],[c_332]) ).
cnf(c_350,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_351,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_353,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_388,plain,
axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_406,plain,
( ~ axiom(or(not(or(X0,or(not(X1),X2))),or(or(not(X1),X2),X0)))
| ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(or(not(X1),X2),X0)) ),
inference(instantiation,[status(thm)],[c_274]) ).
cnf(c_422,plain,
axiom(or(not(not(p)),or(X0,not(p)))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_426,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_539,plain,
( ~ theorem(or(not(X0),or(not(X1),q)))
| ~ axiom(or(not(not(p)),X0))
| theorem(or(not(not(p)),or(not(X1),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_738,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_909,plain,
( ~ theorem(or(not(or(X0,not(p))),or(not(X1),q)))
| ~ axiom(or(not(not(p)),or(X0,not(p))))
| theorem(or(not(not(p)),or(not(X1),q))) ),
inference(instantiation,[status(thm)],[c_539]) ).
cnf(c_942,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_351,c_353]) ).
cnf(c_1675,plain,
( ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_909]) ).
cnf(c_1676,plain,
( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
| theorem(or(not(or(q,not(p))),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_738]) ).
cnf(c_1802,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(X0),or(X1,X3))) ),
inference(superposition,[status(thm)],[c_426,c_57]) ).
cnf(c_2260,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_942,c_350]) ).
cnf(c_2614,plain,
( ~ theorem(or(or(X0,or(X1,X2)),X2))
| theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_942,c_2260]) ).
cnf(c_2926,plain,
axiom(or(not(or(not(X0),or(not(X1),X2))),or(not(X1),or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_246]) ).
cnf(c_4523,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(instantiation,[status(thm)],[c_422]) ).
cnf(c_4525,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(instantiation,[status(thm)],[c_388]) ).
cnf(c_7155,plain,
axiom(or(not(or(not(not(p)),or(not(X0),q))),or(not(X0),or(not(not(p)),q)))),
inference(instantiation,[status(thm)],[c_2926]) ).
cnf(c_7156,plain,
axiom(or(not(or(not(not(p)),or(not(p),q))),or(not(p),or(not(not(p)),q)))),
inference(instantiation,[status(thm)],[c_7155]) ).
cnf(c_22947,plain,
( ~ axiom(or(not(or(q,or(not(or(p,q)),or(not(not(p)),q)))),or(or(not(or(p,q)),or(not(not(p)),q)),q)))
| ~ theorem(or(q,or(not(or(p,q)),or(not(not(p)),q))))
| theorem(or(or(not(or(p,q)),or(not(not(p)),q)),q)) ),
inference(instantiation,[status(thm)],[c_406]) ).
cnf(c_61639,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_62037,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_61639]) ).
cnf(c_62038,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_62227,plain,
axiom(or(not(or(X0,or(not(X1),X2))),or(or(not(X1),X2),X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_64417,plain,
( ~ theorem(or(or(not(X0),or(X1,X2)),X2))
| theorem(or(not(X0),or(X1,X2))) ),
inference(instantiation,[status(thm)],[c_2614]) ).
cnf(c_67510,plain,
( ~ theorem(or(or(not(or(p,q)),or(not(not(p)),q)),q))
| theorem(or(not(or(p,q)),or(not(not(p)),q))) ),
inference(instantiation,[status(thm)],[c_64417]) ).
cnf(c_101182,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(q,or(not(not(p)),q)))),or(q,or(not(or(p,q)),or(not(not(p)),q)))))
| ~ theorem(or(not(or(p,q)),or(q,or(not(not(p)),q))))
| theorem(or(q,or(not(or(p,q)),or(not(not(p)),q)))) ),
inference(instantiation,[status(thm)],[c_62037]) ).
cnf(c_113275,plain,
( ~ theorem(or(not(X0),or(not(not(p)),q)))
| ~ axiom(or(not(or(p,q)),or(q,X0)))
| theorem(or(not(or(p,q)),or(q,or(not(not(p)),q)))) ),
inference(instantiation,[status(thm)],[c_1802]) ).
cnf(c_113276,plain,
( ~ theorem(or(not(p),or(not(not(p)),q)))
| ~ axiom(or(not(or(p,q)),or(q,p)))
| theorem(or(not(or(p,q)),or(q,or(not(not(p)),q)))) ),
inference(instantiation,[status(thm)],[c_113275]) ).
cnf(c_113656,plain,
axiom(or(not(or(not(or(p,q)),or(q,or(not(not(p)),q)))),or(q,or(not(or(p,q)),or(not(not(p)),q))))),
inference(instantiation,[status(thm)],[c_62038]) ).
cnf(c_115951,plain,
axiom(or(not(or(q,or(not(or(p,q)),or(not(not(p)),q)))),or(or(not(or(p,q)),or(not(not(p)),q)),q))),
inference(instantiation,[status(thm)],[c_62227]) ).
cnf(c_115952,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_115951,c_113656,c_113276,c_101182,c_67510,c_22947,c_7156,c_4525,c_4523,c_1676,c_1675,c_333,c_230,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL208-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 24 17:28:51 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 24.53/4.23 % SZS status Started for theBenchmark.p
% 24.53/4.23 % SZS status Unsatisfiable for theBenchmark.p
% 24.53/4.23
% 24.53/4.23 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 24.53/4.23
% 24.53/4.23 ------ iProver source info
% 24.53/4.23
% 24.53/4.23 git: date: 2023-05-31 18:12:56 +0000
% 24.53/4.23 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 24.53/4.23 git: non_committed_changes: false
% 24.53/4.23 git: last_make_outside_of_git: false
% 24.53/4.23
% 24.53/4.23 ------ Parsing...successful
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 24.53/4.23
% 24.53/4.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 24.53/4.23 ------ Proving...
% 24.53/4.23 ------ Problem Properties
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23 clauses 9
% 24.53/4.23 conjectures 1
% 24.53/4.23 EPR 1
% 24.53/4.23 Horn 9
% 24.53/4.23 unary 6
% 24.53/4.23 binary 1
% 24.53/4.23 lits 14
% 24.53/4.23 lits eq 0
% 24.53/4.23 fd_pure 0
% 24.53/4.23 fd_pseudo 0
% 24.53/4.23 fd_cond 0
% 24.53/4.23 fd_pseudo_cond 0
% 24.53/4.23 AC symbols 0
% 24.53/4.23
% 24.53/4.23 ------ Schedule dynamic 5 is on
% 24.53/4.23
% 24.53/4.23 ------ no equalities: superposition off
% 24.53/4.23
% 24.53/4.23 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23 ------
% 24.53/4.23 Current options:
% 24.53/4.23 ------
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23 ------ Proving...
% 24.53/4.23
% 24.53/4.23
% 24.53/4.23 % SZS status Unsatisfiable for theBenchmark.p
% 24.53/4.23
% 24.53/4.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 24.53/4.23
% 24.53/4.23
%------------------------------------------------------------------------------