TSTP Solution File: LCL176-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL176-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:53 EDT 2023
% Result : Unsatisfiable 2.81s 1.18s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 14 unt; 0 nHn; 15 RR)
% Number of literals : 56 ( 5 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 71 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(p,p)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_104,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).
cnf(c_105,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_104]) ).
cnf(c_110,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_111,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_110]) ).
cnf(c_112,plain,
theorem(implies(p,or(p,p))),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_116,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_117,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_116]) ).
cnf(c_122,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_53,c_56]) ).
cnf(c_123,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_122]) ).
cnf(c_282,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_123]) ).
cnf(c_293,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_105,c_57]) ).
cnf(c_294,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_111,c_57]) ).
cnf(c_296,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_123,c_57]) ).
cnf(c_451,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_282,c_55]) ).
cnf(c_454,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_451,c_57]) ).
cnf(c_457,plain,
( ~ theorem(implies(p,or(p,p)))
| theorem(or(p,implies(p,p))) ),
inference(instantiation,[status(thm)],[c_454]) ).
cnf(c_503,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_294,c_296]) ).
cnf(c_608,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_55,c_503]) ).
cnf(c_621,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(light_normalisation,[status(thm)],[c_608,c_55]) ).
cnf(c_781,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_621,c_57]) ).
cnf(c_865,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X2,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_117,c_781]) ).
cnf(c_1378,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,or(X2,X0))) ),
inference(superposition,[status(thm)],[c_865,c_296]) ).
cnf(c_1574,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,implies(X2,X0))) ),
inference(superposition,[status(thm)],[c_55,c_1378]) ).
cnf(c_1666,plain,
( ~ theorem(or(X0,implies(X1,X0)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_1574,c_293]) ).
cnf(c_1684,plain,
( ~ theorem(or(p,implies(p,p)))
| theorem(implies(p,p)) ),
inference(instantiation,[status(thm)],[c_1666]) ).
cnf(c_1685,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1684,c_457,c_112,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL176-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 04:50:32 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.81/1.18 % SZS status Started for theBenchmark.p
% 2.81/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.81/1.18
% 2.81/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.81/1.18
% 2.81/1.18 ------ iProver source info
% 2.81/1.18
% 2.81/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.81/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.81/1.18 git: non_committed_changes: false
% 2.81/1.18 git: last_make_outside_of_git: false
% 2.81/1.18
% 2.81/1.18 ------ Parsing...successful
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 2.81/1.18
% 2.81/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.81/1.18
% 2.81/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.81/1.18 ------ Proving...
% 2.81/1.18 ------ Problem Properties
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18 clauses 8
% 2.81/1.18 conjectures 1
% 2.81/1.18 EPR 0
% 2.81/1.18 Horn 8
% 2.81/1.18 unary 7
% 2.81/1.18 binary 0
% 2.81/1.18 lits 10
% 2.81/1.18 lits eq 1
% 2.81/1.18 fd_pure 0
% 2.81/1.18 fd_pseudo 0
% 2.81/1.18 fd_cond 0
% 2.81/1.18 fd_pseudo_cond 0
% 2.81/1.18 AC symbols 0
% 2.81/1.18
% 2.81/1.18 ------ Schedule dynamic 5 is on
% 2.81/1.18
% 2.81/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18 ------
% 2.81/1.18 Current options:
% 2.81/1.18 ------
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18 ------ Proving...
% 2.81/1.18
% 2.81/1.18
% 2.81/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.81/1.18
% 2.81/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.81/1.18
% 2.81/1.18
%------------------------------------------------------------------------------