TSTP Solution File: LCL268-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:39 EDT 2023
% Result : Unsatisfiable 3.62s 1.19s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of clauses : 46 ( 22 unt; 0 nHn; 19 RR)
% Number of literals : 72 ( 9 equ; 27 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 : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 88 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(equivalent(p,p)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
and(implies(X0,X1),implies(X1,X0)) = equivalent(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(c_51,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_52,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_53,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_54,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_55,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_57,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_58,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_59,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_105,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_51,c_57]) ).
cnf(c_117,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_52,c_58]) ).
cnf(c_118,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_117]) ).
cnf(c_123,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_58]) ).
cnf(c_124,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_123]) ).
cnf(c_125,plain,
theorem(implies(p,or(p,p))),
inference(instantiation,[status(thm)],[c_124]) ).
cnf(c_129,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_54,c_58]) ).
cnf(c_130,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_129]) ).
cnf(c_135,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_55,c_58]) ).
cnf(c_136,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_135]) ).
cnf(c_338,plain,
theorem(implies(implies(X0,not(X0)),not(X0))),
inference(superposition,[status(thm)],[c_57,c_118]) ).
cnf(c_348,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_136]) ).
cnf(c_359,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_118,c_59]) ).
cnf(c_360,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_124,c_59]) ).
cnf(c_361,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_130,c_59]) ).
cnf(c_362,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_136,c_59]) ).
cnf(c_387,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_105,c_57]) ).
cnf(c_390,plain,
theorem(or(and(X0,X0),not(X0))),
inference(demodulation,[status(thm)],[c_338,c_387]) ).
cnf(c_434,plain,
theorem(or(not(X0),and(X0,X0))),
inference(superposition,[status(thm)],[c_390,c_361]) ).
cnf(c_455,plain,
theorem(implies(X0,and(X0,X0))),
inference(demodulation,[status(thm)],[c_434,c_57]) ).
cnf(c_457,plain,
( ~ theorem(X0)
| theorem(and(X0,X0)) ),
inference(superposition,[status(thm)],[c_455,c_59]) ).
cnf(c_470,plain,
( ~ theorem(implies(X0,X0))
| theorem(equivalent(X0,X0)) ),
inference(superposition,[status(thm)],[c_50,c_457]) ).
cnf(c_473,plain,
( ~ theorem(implies(p,p))
| theorem(equivalent(p,p)) ),
inference(instantiation,[status(thm)],[c_470]) ).
cnf(c_662,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_348,c_57]) ).
cnf(c_665,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_662,c_59]) ).
cnf(c_668,plain,
( ~ theorem(implies(p,or(p,p)))
| theorem(or(p,implies(p,p))) ),
inference(instantiation,[status(thm)],[c_665]) ).
cnf(c_716,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_360,c_362]) ).
cnf(c_824,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_57,c_716]) ).
cnf(c_837,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(light_normalisation,[status(thm)],[c_824,c_57]) ).
cnf(c_873,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_837,c_59]) ).
cnf(c_1186,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X2,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_130,c_873]) ).
cnf(c_1660,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,or(X2,X0))) ),
inference(superposition,[status(thm)],[c_1186,c_362]) ).
cnf(c_2193,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,implies(X2,X0))) ),
inference(superposition,[status(thm)],[c_57,c_1660]) ).
cnf(c_2401,plain,
( ~ theorem(or(X0,implies(X1,X0)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_2193,c_359]) ).
cnf(c_2421,plain,
( ~ theorem(or(p,implies(p,p)))
| theorem(implies(p,p)) ),
inference(instantiation,[status(thm)],[c_2401]) ).
cnf(c_2422,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2421,c_668,c_473,c_125,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n019.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 02:09:13 EDT 2023
% 0.14/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.62/1.19 % SZS status Started for theBenchmark.p
% 3.62/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.19
% 3.62/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.62/1.19
% 3.62/1.19 ------ iProver source info
% 3.62/1.19
% 3.62/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.62/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.62/1.19 git: non_committed_changes: false
% 3.62/1.19 git: last_make_outside_of_git: false
% 3.62/1.19
% 3.62/1.19 ------ Parsing...successful
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19 ------ Preprocessing... sup_sim: 1 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
% 3.62/1.19
% 3.62/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.62/1.19
% 3.62/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.19 ------ Proving...
% 3.62/1.19 ------ Problem Properties
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19 clauses 10
% 3.62/1.19 conjectures 1
% 3.62/1.19 EPR 0
% 3.62/1.19 Horn 10
% 3.62/1.19 unary 9
% 3.62/1.19 binary 0
% 3.62/1.19 lits 12
% 3.62/1.19 lits eq 3
% 3.62/1.19 fd_pure 0
% 3.62/1.19 fd_pseudo 0
% 3.62/1.19 fd_cond 0
% 3.62/1.19 fd_pseudo_cond 0
% 3.62/1.19 AC symbols 0
% 3.62/1.19
% 3.62/1.19 ------ Schedule dynamic 5 is on
% 3.62/1.19
% 3.62/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19 ------
% 3.62/1.19 Current options:
% 3.62/1.19 ------
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19 ------ Proving...
% 3.62/1.19
% 3.62/1.19
% 3.62/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.19
% 3.62/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.19
% 3.62/1.19
%------------------------------------------------------------------------------