TSTP Solution File: LCL177-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL177-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Fri May 3 02:37:05 EDT 2024
% Result : Unsatisfiable 0.45s 1.13s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 30 ( 0 equ; 14 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(p,not(p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
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_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_92,plain,
theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_50,c_55]) ).
cnf(c_93,plain,
theorem(or(not(or(p,p)),p)),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_125,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(resolution,[status(thm)],[c_51,c_57]) ).
cnf(c_126,plain,
( ~ theorem(or(not(or(p,p)),p))
| theorem(or(not(p),p)) ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_420,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_517,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(X1,not(X0))))
| ~ theorem(or(not(X0),X1))
| theorem(or(X1,not(X0))) ),
inference(instantiation,[status(thm)],[c_420]) ).
cnf(c_518,plain,
axiom(or(not(or(not(X0),X1)),or(X1,not(X0)))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_519,plain,
( ~ axiom(or(not(or(not(p),p)),or(p,not(p))))
| ~ theorem(or(not(p),p))
| theorem(or(p,not(p))) ),
inference(instantiation,[status(thm)],[c_517]) ).
cnf(c_520,plain,
axiom(or(not(or(not(p),p)),or(p,not(p)))),
inference(instantiation,[status(thm)],[c_518]) ).
cnf(c_521,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_520,c_519,c_126,c_93,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL177-1 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:35:03 EDT 2024
% 0.11/0.32 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.13 % SZS status Started for theBenchmark.p
% 0.45/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.13
% 0.45/1.13 ------ iProver source info
% 0.45/1.13
% 0.45/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.13 git: non_committed_changes: false
% 0.45/1.13
% 0.45/1.13 ------ Parsing...successful
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.13 ------ Proving...
% 0.45/1.13 ------ Problem Properties
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 clauses 11
% 0.45/1.13 conjectures 1
% 0.45/1.13 EPR 2
% 0.45/1.13 Horn 11
% 0.45/1.13 unary 8
% 0.45/1.13 binary 1
% 0.45/1.13 lits 16
% 0.45/1.13 lits eq 2
% 0.45/1.13 fd_pure 0
% 0.45/1.13 fd_pseudo 0
% 0.45/1.13 fd_cond 0
% 0.45/1.13 fd_pseudo_cond 0
% 0.45/1.13 AC symbols 0
% 0.45/1.13
% 0.45/1.13 ------ Schedule dynamic 5 is on
% 0.45/1.13
% 0.45/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------
% 0.45/1.13 Current options:
% 0.45/1.13 ------
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Proving...
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.13
% 0.45/1.13
%------------------------------------------------------------------------------