TSTP Solution File: LCL268-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:31 EDT 2024
% Result : Unsatisfiable 3.96s 1.18s
% Output : CNFRefutation 3.96s
% 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_344,plain,
theorem(implies(implies(X0,not(X0)),not(X0))),
inference(superposition,[status(thm)],[c_57,c_118]) ).
cnf(c_352,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_136]) ).
cnf(c_363,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_118,c_59]) ).
cnf(c_364,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_124,c_59]) ).
cnf(c_365,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_130,c_59]) ).
cnf(c_366,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_389,plain,
theorem(or(and(X0,X0),not(X0))),
inference(demodulation,[status(thm)],[c_344,c_387]) ).
cnf(c_438,plain,
theorem(or(not(X0),and(X0,X0))),
inference(superposition,[status(thm)],[c_389,c_365]) ).
cnf(c_461,plain,
theorem(implies(X0,and(X0,X0))),
inference(demodulation,[status(thm)],[c_438,c_57]) ).
cnf(c_463,plain,
( ~ theorem(X0)
| theorem(and(X0,X0)) ),
inference(superposition,[status(thm)],[c_461,c_59]) ).
cnf(c_472,plain,
( ~ theorem(implies(X0,X0))
| theorem(equivalent(X0,X0)) ),
inference(superposition,[status(thm)],[c_50,c_463]) ).
cnf(c_475,plain,
( ~ theorem(implies(p,p))
| theorem(equivalent(p,p)) ),
inference(instantiation,[status(thm)],[c_472]) ).
cnf(c_625,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_352,c_57]) ).
cnf(c_628,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_625,c_59]) ).
cnf(c_631,plain,
( ~ theorem(implies(p,or(p,p)))
| theorem(or(p,implies(p,p))) ),
inference(instantiation,[status(thm)],[c_628]) ).
cnf(c_739,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_364,c_366]) ).
cnf(c_850,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_57,c_739]) ).
cnf(c_863,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(light_normalisation,[status(thm)],[c_850,c_57]) ).
cnf(c_1011,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_863,c_59]) ).
cnf(c_1085,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X2,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_130,c_1011]) ).
cnf(c_1574,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,or(X2,X0))) ),
inference(superposition,[status(thm)],[c_1085,c_366]) ).
cnf(c_1869,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,implies(X2,X0))) ),
inference(superposition,[status(thm)],[c_57,c_1574]) ).
cnf(c_2069,plain,
( ~ theorem(or(X0,implies(X1,X0)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_1869,c_363]) ).
cnf(c_2087,plain,
( ~ theorem(or(p,implies(p,p)))
| theorem(implies(p,p)) ),
inference(instantiation,[status(thm)],[c_2069]) ).
cnf(c_2088,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2087,c_631,c_475,c_125,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.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:11:33 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.96/1.18 % SZS status Started for theBenchmark.p
% 3.96/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.96/1.18
% 3.96/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.96/1.18
% 3.96/1.18 ------ iProver source info
% 3.96/1.18
% 3.96/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.96/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.96/1.18 git: non_committed_changes: false
% 3.96/1.18
% 3.96/1.18 ------ Parsing...successful
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18 ------ 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.96/1.18
% 3.96/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.96/1.18
% 3.96/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.96/1.18 ------ Proving...
% 3.96/1.18 ------ Problem Properties
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18 clauses 11
% 3.96/1.18 conjectures 1
% 3.96/1.18 EPR 1
% 3.96/1.18 Horn 11
% 3.96/1.18 unary 10
% 3.96/1.18 binary 0
% 3.96/1.18 lits 13
% 3.96/1.18 lits eq 4
% 3.96/1.18 fd_pure 0
% 3.96/1.18 fd_pseudo 0
% 3.96/1.18 fd_cond 0
% 3.96/1.18 fd_pseudo_cond 0
% 3.96/1.18 AC symbols 0
% 3.96/1.18
% 3.96/1.18 ------ Schedule dynamic 5 is on
% 3.96/1.18
% 3.96/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18 ------
% 3.96/1.18 Current options:
% 3.96/1.18 ------
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18 ------ Proving...
% 3.96/1.18
% 3.96/1.18
% 3.96/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.96/1.18
% 3.96/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.18
% 3.96/1.18
%------------------------------------------------------------------------------