TSTP Solution File: LCL215-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL215-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:17 EDT 2024
% Result : Unsatisfiable 9.06s 2.17s
% Output : CNFRefutation 9.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 24 RR)
% Number of literals : 62 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 2 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 : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),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_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_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(q,q)),q)),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_217,plain,
( ~ axiom(or(not(X0),or(not(or(not(p),q)),or(not(or(p,q)),q))))
| ~ theorem(X0)
| theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_221,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(not(p),q)),or(not(or(p,q)),q))))
| ~ theorem(or(not(X0),X1))
| theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_217]) ).
cnf(c_232,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_235,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(p,q)),q))))
| ~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_221]) ).
cnf(c_237,plain,
axiom(or(not(or(not(p),q)),or(not(or(X0,p)),or(X0,q)))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_238,plain,
axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q)))),
inference(instantiation,[status(thm)],[c_237]) ).
cnf(c_259,plain,
( ~ theorem(or(not(X0),or(not(or(not(p),q)),q)))
| ~ axiom(or(not(or(p,q)),X0))
| theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_272,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_232]) ).
cnf(c_274,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))))
| ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_316,plain,
( ~ theorem(or(not(or(q,p)),or(not(or(not(p),q)),q)))
| ~ axiom(or(not(or(p,q)),or(q,p)))
| theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))) ),
inference(instantiation,[status(thm)],[c_259]) ).
cnf(c_333,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_355,plain,
axiom(or(not(or(p,q)),or(q,p))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_387,plain,
axiom(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(p,q)),q)))),
inference(instantiation,[status(thm)],[c_333]) ).
cnf(c_490,plain,
( ~ axiom(or(not(or(not(or(not(p),q)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(or(not(p),q)),q))))
| ~ theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
| theorem(or(not(or(q,p)),or(not(or(not(p),q)),q))) ),
inference(instantiation,[status(thm)],[c_272]) ).
cnf(c_569,plain,
axiom(or(not(or(not(or(not(p),q)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(or(not(p),q)),q)))),
inference(instantiation,[status(thm)],[c_333]) ).
cnf(c_890,plain,
( ~ theorem(or(not(X0),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(p),q)),X0))
| theorem(or(not(or(not(p),q)),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_1863,plain,
( ~ theorem(or(not(or(not(or(X0,p)),or(X0,q))),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(p),q)),or(not(or(X0,p)),or(X0,q))))
| theorem(or(not(or(not(p),q)),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_890]) ).
cnf(c_1864,plain,
( ~ theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q))))
| theorem(or(not(or(not(p),q)),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_1863]) ).
cnf(c_8054,plain,
( ~ axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))))
| ~ theorem(or(not(or(q,q)),q))
| theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_274]) ).
cnf(c_14594,plain,
axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_14595,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14594,c_8054,c_1864,c_569,c_490,c_387,c_355,c_316,c_238,c_235,c_93,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL215-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 19:36:33 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.06/2.17 % SZS status Started for theBenchmark.p
% 9.06/2.17 % SZS status Unsatisfiable for theBenchmark.p
% 9.06/2.17
% 9.06/2.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 9.06/2.17
% 9.06/2.17 ------ iProver source info
% 9.06/2.17
% 9.06/2.17 git: date: 2024-05-02 19:28:25 +0000
% 9.06/2.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 9.06/2.17 git: non_committed_changes: false
% 9.06/2.17
% 9.06/2.17 ------ Parsing...successful
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 9.06/2.17
% 9.06/2.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.06/2.17 ------ Proving...
% 9.06/2.17 ------ Problem Properties
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17 clauses 9
% 9.06/2.17 conjectures 1
% 9.06/2.17 EPR 1
% 9.06/2.17 Horn 9
% 9.06/2.17 unary 6
% 9.06/2.17 binary 1
% 9.06/2.17 lits 14
% 9.06/2.17 lits eq 0
% 9.06/2.17 fd_pure 0
% 9.06/2.17 fd_pseudo 0
% 9.06/2.17 fd_cond 0
% 9.06/2.17 fd_pseudo_cond 0
% 9.06/2.17 AC symbols 0
% 9.06/2.17
% 9.06/2.17 ------ Input Options Time Limit: Unbounded
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17 ------
% 9.06/2.17 Current options:
% 9.06/2.17 ------
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17 ------ Proving...
% 9.06/2.17
% 9.06/2.17
% 9.06/2.17 % SZS status Unsatisfiable for theBenchmark.p
% 9.06/2.17
% 9.06/2.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.06/2.17
% 9.06/2.17
%------------------------------------------------------------------------------