TSTP Solution File: LCL204-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL204-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:08 EDT 2023
% Result : Unsatisfiable 27.82s 4.70s
% Output : CNFRefutation 27.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 14 unt; 0 nHn; 17 RR)
% Number of literals : 50 ( 0 equ; 23 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 : 45 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(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_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_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_290,plain,
( ~ axiom(or(not(or(not(not(p)),or(not(not(or(not(p),q))),q))),or(not(not(or(not(p),q))),or(not(not(p)),q))))
| ~ theorem(or(not(not(p)),or(not(not(or(not(p),q))),q)))
| theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))) ),
inference(instantiation,[status(thm)],[c_244]) ).
cnf(c_340,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_374,plain,
axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_394,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_467,plain,
axiom(or(not(not(p)),or(X0,not(p)))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_511,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| theorem(or(not(X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_340,c_57]) ).
cnf(c_2596,plain,
theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_51,c_511]) ).
cnf(c_2680,plain,
theorem(or(X0,or(not(X0),X1))),
inference(superposition,[status(thm)],[c_2596,c_394]) ).
cnf(c_3061,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),or(not(not(X1)),X2))) ),
inference(superposition,[status(thm)],[c_2680,c_57]) ).
cnf(c_6131,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(instantiation,[status(thm)],[c_467]) ).
cnf(c_6133,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(instantiation,[status(thm)],[c_374]) ).
cnf(c_60774,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| theorem(or(not(or(X0,X1)),or(not(not(or(X1,X0))),X2))) ),
inference(instantiation,[status(thm)],[c_3061]) ).
cnf(c_61122,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_65875,plain,
( ~ theorem(or(not(X0),or(not(not(or(not(p),q))),q)))
| ~ axiom(or(not(not(p)),X0))
| theorem(or(not(not(p)),or(not(not(or(not(p),q))),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_73804,plain,
( ~ theorem(or(not(or(X0,not(p))),or(not(not(or(not(p),q))),q)))
| ~ axiom(or(not(not(p)),or(X0,not(p))))
| theorem(or(not(not(p)),or(not(not(or(not(p),q))),q))) ),
inference(instantiation,[status(thm)],[c_65875]) ).
cnf(c_87137,plain,
( ~ theorem(or(not(or(q,not(p))),or(not(not(or(not(p),q))),q)))
| ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(not(not(or(not(p),q))),q))) ),
inference(instantiation,[status(thm)],[c_73804]) ).
cnf(c_87138,plain,
( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
| theorem(or(not(or(q,not(p))),or(not(not(or(not(p),q))),q))) ),
inference(instantiation,[status(thm)],[c_60774]) ).
cnf(c_91515,plain,
axiom(or(not(or(not(not(p)),or(not(not(or(not(p),q))),q))),or(not(not(or(not(p),q))),or(not(not(p)),q)))),
inference(instantiation,[status(thm)],[c_61122]) ).
cnf(c_91516,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_91515,c_87138,c_87137,c_6133,c_6131,c_290,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL204-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 24 18:59:28 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 27.82/4.70 % SZS status Started for theBenchmark.p
% 27.82/4.70 % SZS status Unsatisfiable for theBenchmark.p
% 27.82/4.70
% 27.82/4.70 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 27.82/4.70
% 27.82/4.70 ------ iProver source info
% 27.82/4.70
% 27.82/4.70 git: date: 2023-05-31 18:12:56 +0000
% 27.82/4.70 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 27.82/4.70 git: non_committed_changes: false
% 27.82/4.70 git: last_make_outside_of_git: false
% 27.82/4.70
% 27.82/4.70 ------ Parsing...successful
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 27.82/4.70
% 27.82/4.70 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 27.82/4.70 ------ Proving...
% 27.82/4.70 ------ Problem Properties
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70 clauses 9
% 27.82/4.70 conjectures 1
% 27.82/4.70 EPR 1
% 27.82/4.70 Horn 9
% 27.82/4.70 unary 6
% 27.82/4.70 binary 1
% 27.82/4.70 lits 14
% 27.82/4.70 lits eq 0
% 27.82/4.70 fd_pure 0
% 27.82/4.70 fd_pseudo 0
% 27.82/4.70 fd_cond 0
% 27.82/4.70 fd_pseudo_cond 0
% 27.82/4.70 AC symbols 0
% 27.82/4.70
% 27.82/4.70 ------ Schedule dynamic 5 is on
% 27.82/4.70
% 27.82/4.70 ------ no equalities: superposition off
% 27.82/4.70
% 27.82/4.70 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70 ------
% 27.82/4.70 Current options:
% 27.82/4.70 ------
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70 ------ Proving...
% 27.82/4.70
% 27.82/4.70
% 27.82/4.70 % SZS status Unsatisfiable for theBenchmark.p
% 27.82/4.70
% 27.82/4.70 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 27.82/4.70
% 27.82/4.70
%------------------------------------------------------------------------------