TSTP Solution File: LCL211-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL211-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:11 EDT 2023
% Result : Unsatisfiable 3.94s 1.19s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 36 ( 18 unt; 0 nHn; 25 RR)
% Number of literals : 71 ( 0 equ; 36 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 : 42 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(q)),or(not(or(p,q)),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_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
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_221,plain,
( ~ theorem(or(not(X0),or(not(or(p,q)),p)))
| ~ axiom(or(not(not(q)),X0))
| theorem(or(not(not(q)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_57]) ).
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_225,plain,
( ~ theorem(or(not(or(X0,not(q))),or(not(or(p,q)),p)))
| ~ axiom(or(not(not(q)),or(X0,not(q))))
| theorem(or(not(not(q)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_221]) ).
cnf(c_226,plain,
axiom(or(not(not(q)),or(X0,not(q)))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_227,plain,
( ~ theorem(or(not(or(p,not(q))),or(not(or(p,q)),p)))
| ~ axiom(or(not(not(q)),or(p,not(q))))
| theorem(or(not(not(q)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_225]) ).
cnf(c_228,plain,
axiom(or(not(not(q)),or(p,not(q)))),
inference(instantiation,[status(thm)],[c_226]) ).
cnf(c_247,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_223]) ).
cnf(c_253,plain,
( ~ theorem(or(not(X0),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(X1,not(q))),X0))
| theorem(or(not(or(X1,not(q))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_290,plain,
( ~ theorem(or(not(X0),or(not(or(p,q)),p)))
| ~ axiom(or(not(X1),X0))
| theorem(or(not(X1),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_300,plain,
( ~ axiom(or(not(or(not(X0),p)),or(not(or(not(or(p,q)),X0)),or(not(or(p,q)),p))))
| ~ theorem(or(not(X0),p))
| theorem(or(not(or(not(or(p,q)),X0)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_247]) ).
cnf(c_344,plain,
axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_479,plain,
axiom(or(not(or(not(X0),p)),or(not(or(not(or(p,q)),X0)),or(not(or(p,q)),p)))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_602,plain,
( ~ theorem(or(not(or(not(q),X0)),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(X0,not(q))),or(not(q),X0)))
| theorem(or(not(or(X0,not(q))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_253]) ).
cnf(c_603,plain,
axiom(or(not(or(X0,not(q))),or(not(q),X0))),
inference(instantiation,[status(thm)],[c_344]) ).
cnf(c_604,plain,
( ~ theorem(or(not(or(not(q),p)),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(p,not(q))),or(not(q),p)))
| theorem(or(not(or(p,not(q))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_602]) ).
cnf(c_605,plain,
axiom(or(not(or(p,not(q))),or(not(q),p))),
inference(instantiation,[status(thm)],[c_603]) ).
cnf(c_957,plain,
( ~ theorem(or(not(X0),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(not(q),X1)),X0))
| theorem(or(not(or(not(q),X1)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_290]) ).
cnf(c_2224,plain,
( ~ theorem(or(not(or(not(or(X0,q)),or(X0,X1))),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(not(q),X1)),or(not(or(X0,q)),or(X0,X1))))
| theorem(or(not(or(not(q),X1)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_957]) ).
cnf(c_2225,plain,
axiom(or(not(or(not(q),X0)),or(not(or(X1,q)),or(X1,X0)))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_2226,plain,
( ~ theorem(or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(not(q),p)),or(not(or(p,q)),or(p,p))))
| theorem(or(not(or(not(q),p)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_2224]) ).
cnf(c_2227,plain,
axiom(or(not(or(not(q),p)),or(not(or(p,q)),or(p,p)))),
inference(instantiation,[status(thm)],[c_2225]) ).
cnf(c_6543,plain,
( ~ axiom(or(not(or(not(or(p,X0)),p)),or(not(or(not(or(p,q)),or(p,X0))),or(not(or(p,q)),p))))
| ~ theorem(or(not(or(p,X0)),p))
| theorem(or(not(or(not(or(p,q)),or(p,X0))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_300]) ).
cnf(c_6544,plain,
( ~ axiom(or(not(or(not(or(p,p)),p)),or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p))))
| ~ theorem(or(not(or(p,p)),p))
| theorem(or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_6543]) ).
cnf(c_11415,plain,
axiom(or(not(or(not(or(p,X0)),p)),or(not(or(not(or(p,q)),or(p,X0))),or(not(or(p,q)),p)))),
inference(instantiation,[status(thm)],[c_479]) ).
cnf(c_11416,plain,
axiom(or(not(or(not(or(p,p)),p)),or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p)))),
inference(instantiation,[status(thm)],[c_11415]) ).
cnf(c_11417,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11416,c_6544,c_2227,c_2226,c_605,c_604,c_228,c_227,c_93,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL211-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 25 00:41:50 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.94/1.19 % SZS status Started for theBenchmark.p
% 3.94/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.94/1.19
% 3.94/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.94/1.19
% 3.94/1.19 ------ iProver source info
% 3.94/1.19
% 3.94/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.94/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.94/1.19 git: non_committed_changes: false
% 3.94/1.19 git: last_make_outside_of_git: false
% 3.94/1.19
% 3.94/1.19 ------ Parsing...successful
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.94/1.19
% 3.94/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.94/1.19 ------ Proving...
% 3.94/1.19 ------ Problem Properties
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19 clauses 9
% 3.94/1.19 conjectures 1
% 3.94/1.19 EPR 1
% 3.94/1.19 Horn 9
% 3.94/1.19 unary 6
% 3.94/1.19 binary 1
% 3.94/1.19 lits 14
% 3.94/1.19 lits eq 0
% 3.94/1.19 fd_pure 0
% 3.94/1.19 fd_pseudo 0
% 3.94/1.19 fd_cond 0
% 3.94/1.19 fd_pseudo_cond 0
% 3.94/1.19 AC symbols 0
% 3.94/1.19
% 3.94/1.19 ------ Schedule dynamic 5 is on
% 3.94/1.19
% 3.94/1.19 ------ no equalities: superposition off
% 3.94/1.19
% 3.94/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19 ------
% 3.94/1.19 Current options:
% 3.94/1.19 ------
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19 ------ Proving...
% 3.94/1.19
% 3.94/1.19
% 3.94/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.94/1.19
% 3.94/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.19
% 3.94/1.19
%------------------------------------------------------------------------------