TSTP Solution File: LCL213-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL213-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 14.18s 2.66s
% Output : CNFRefutation 14.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 38 ( 12 unt; 0 nHn; 27 RR)
% Number of literals : 75 ( 0 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(or(not(not(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_231,plain,
( ~ axiom(or(not(or(not(or(X0,X0)),X0)),X1))
| ~ theorem(or(not(or(X0,X0)),X0))
| theorem(X1) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_233,plain,
( ~ axiom(or(not(or(not(or(X0,X0)),X0)),X1))
| theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_231,c_92,c_231]) ).
cnf(c_263,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| ~ theorem(or(not(or(X1,X0)),X2))
| theorem(or(not(or(X0,X1)),X2)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_264,plain,
( ~ theorem(or(not(or(X1,X0)),X2))
| theorem(or(not(or(X0,X1)),X2)) ),
inference(global_subsumption_just,[status(thm)],[c_263,c_52,c_263]) ).
cnf(c_265,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X1,X0)),X2)) ),
inference(renaming,[status(thm)],[c_264]) ).
cnf(c_275,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))))
| ~ theorem(or(not(or(not(or(X2,X0)),or(X2,X1))),X3))
| theorem(or(not(or(not(X0),X1)),X3)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_278,plain,
( ~ axiom(or(not(or(not(or(X0,X0)),X0)),X1))
| ~ theorem(or(not(or(X0,X0)),X0))
| theorem(X1) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_279,plain,
( ~ axiom(or(not(or(not(or(X0,X0)),X0)),X1))
| theorem(X1) ),
inference(global_subsumption_just,[status(thm)],[c_278,c_233]) ).
cnf(c_290,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_293,plain,
( ~ theorem(or(not(or(q,not(p))),or(not(or(not(not(p)),q)),q)))
| theorem(or(not(or(not(p),q)),or(not(or(not(not(p)),q)),q))) ),
inference(instantiation,[status(thm)],[c_265]) ).
cnf(c_330,plain,
( ~ axiom(or(not(or(not(or(X0,X0)),X0)),or(not(or(X1,or(X0,X0))),or(X1,X0))))
| theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_279]) ).
cnf(c_356,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_290]) ).
cnf(c_481,plain,
axiom(or(not(or(not(or(X0,X0)),X0)),or(not(or(X1,or(X0,X0))),or(X1,X0)))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_513,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_628,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))))
| ~ theorem(or(not(or(not(or(X2,X0)),or(X2,X1))),X3))
| theorem(or(not(or(not(X0),X1)),X3)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_629,plain,
( ~ theorem(or(not(or(not(or(X2,X0)),or(X2,X1))),X3))
| theorem(or(not(or(not(X0),X1)),X3)) ),
inference(global_subsumption_just,[status(thm)],[c_628,c_54,c_275]) ).
cnf(c_630,plain,
( ~ theorem(or(not(or(not(or(X0,X1)),or(X0,X2))),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(renaming,[status(thm)],[c_629]) ).
cnf(c_641,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_735,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_641]) ).
cnf(c_736,plain,
( ~ theorem(or(not(X0),or(X1,X2)))
| theorem(or(X1,or(not(X0),X2))) ),
inference(global_subsumption_just,[status(thm)],[c_735,c_356,c_513]) ).
cnf(c_993,plain,
( ~ theorem(or(not(or(not(not(p)),q)),or(not(or(q,not(p))),q)))
| theorem(or(not(or(q,not(p))),or(not(or(not(not(p)),q)),q))) ),
inference(instantiation,[status(thm)],[c_736]) ).
cnf(c_2111,plain,
( ~ theorem(or(not(or(not(or(X0,not(p))),or(X0,q))),or(not(or(q,not(p))),q)))
| theorem(or(not(or(not(not(p)),q)),or(not(or(q,not(p))),q))) ),
inference(instantiation,[status(thm)],[c_630]) ).
cnf(c_2112,plain,
( ~ theorem(or(not(or(not(or(q,not(p))),or(q,q))),or(not(or(q,not(p))),q)))
| theorem(or(not(or(not(not(p)),q)),or(not(or(q,not(p))),q))) ),
inference(instantiation,[status(thm)],[c_2111]) ).
cnf(c_2779,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_11321,plain,
( ~ theorem(or(not(or(X0,X0)),X0))
| theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_2779]) ).
cnf(c_11322,plain,
theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_11321,c_330,c_481]) ).
cnf(c_11323,plain,
theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))),
inference(renaming,[status(thm)],[c_11322]) ).
cnf(c_34584,plain,
theorem(or(not(or(not(or(q,not(p))),or(q,q))),or(not(or(q,not(p))),q))),
inference(instantiation,[status(thm)],[c_11323]) ).
cnf(c_34585,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_34584,c_2112,c_993,c_293,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL213-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.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 May 2 19:32:07 EDT 2024
% 0.20/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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.18/2.66 % SZS status Started for theBenchmark.p
% 14.18/2.66 % SZS status Unsatisfiable for theBenchmark.p
% 14.18/2.66
% 14.18/2.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 14.18/2.66
% 14.18/2.66 ------ iProver source info
% 14.18/2.66
% 14.18/2.66 git: date: 2024-05-02 19:28:25 +0000
% 14.18/2.66 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 14.18/2.66 git: non_committed_changes: false
% 14.18/2.66
% 14.18/2.66 ------ Parsing...successful
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 14.18/2.66
% 14.18/2.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 14.18/2.66 ------ Proving...
% 14.18/2.66 ------ Problem Properties
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66 clauses 9
% 14.18/2.66 conjectures 1
% 14.18/2.66 EPR 1
% 14.18/2.66 Horn 9
% 14.18/2.66 unary 6
% 14.18/2.66 binary 1
% 14.18/2.66 lits 14
% 14.18/2.66 lits eq 0
% 14.18/2.66 fd_pure 0
% 14.18/2.66 fd_pseudo 0
% 14.18/2.66 fd_cond 0
% 14.18/2.66 fd_pseudo_cond 0
% 14.18/2.66 AC symbols 0
% 14.18/2.66
% 14.18/2.66 ------ Input Options Time Limit: Unbounded
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66 ------
% 14.18/2.66 Current options:
% 14.18/2.66 ------
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66 ------ Proving...
% 14.18/2.66
% 14.18/2.66
% 14.18/2.66 % SZS status Unsatisfiable for theBenchmark.p
% 14.18/2.66
% 14.18/2.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.18/2.66
% 14.18/2.66
%------------------------------------------------------------------------------