TSTP Solution File: LCL186-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL186-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:42:58 EDT 2023
% Result : Unsatisfiable 1.71s 1.12s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 25 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 13 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(p)),or(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
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_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
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_221,plain,
( ~ theorem(or(not(X0),or(not(p),q)))
| ~ axiom(or(not(not(p)),X0))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_225,plain,
( ~ theorem(or(not(or(X0,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(X0,not(p))))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(instantiation,[status(thm)],[c_221]) ).
cnf(c_226,plain,
axiom(or(not(not(p)),or(X0,not(p)))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_255,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_225]) ).
cnf(c_256,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_218]) ).
cnf(c_286,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(instantiation,[status(thm)],[c_226]) ).
cnf(c_287,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_288,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_287,c_286,c_256,c_255,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL186-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n020.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 23:02:45 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.71/1.12 % SZS status Started for theBenchmark.p
% 1.71/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 1.71/1.12
% 1.71/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.71/1.12
% 1.71/1.12 ------ iProver source info
% 1.71/1.12
% 1.71/1.12 git: date: 2023-05-31 18:12:56 +0000
% 1.71/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.71/1.12 git: non_committed_changes: false
% 1.71/1.12 git: last_make_outside_of_git: false
% 1.71/1.12
% 1.71/1.12 ------ Parsing...successful
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.71/1.12
% 1.71/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.71/1.12 ------ Proving...
% 1.71/1.12 ------ Problem Properties
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12 clauses 9
% 1.71/1.12 conjectures 1
% 1.71/1.12 EPR 1
% 1.71/1.12 Horn 9
% 1.71/1.12 unary 6
% 1.71/1.12 binary 1
% 1.71/1.12 lits 14
% 1.71/1.12 lits eq 0
% 1.71/1.12 fd_pure 0
% 1.71/1.12 fd_pseudo 0
% 1.71/1.12 fd_cond 0
% 1.71/1.12 fd_pseudo_cond 0
% 1.71/1.12 AC symbols 0
% 1.71/1.12
% 1.71/1.12 ------ Schedule dynamic 5 is on
% 1.71/1.12
% 1.71/1.12 ------ no equalities: superposition off
% 1.71/1.12
% 1.71/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12 ------
% 1.71/1.12 Current options:
% 1.71/1.12 ------
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12 ------ Proving...
% 1.71/1.12
% 1.71/1.12
% 1.71/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 1.71/1.12
% 1.71/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.71/1.12
% 1.71/1.12
%------------------------------------------------------------------------------