TSTP Solution File: LCL239-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL239-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 : Fri May 3 02:37:25 EDT 2024
% Result : Unsatisfiable 4.39s 1.15s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 21 unt; 0 nHn; 15 RR)
% Number of literals : 46 ( 7 equ; 14 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 61 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(not(and(p,not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_51,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_52,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_53,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_54,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_56,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_57,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_58,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_101,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_56]) ).
cnf(c_112,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_51,c_57]) ).
cnf(c_113,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_112]) ).
cnf(c_118,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_57]) ).
cnf(c_119,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_118]) ).
cnf(c_124,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_57]) ).
cnf(c_125,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_124]) ).
cnf(c_130,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_57]) ).
cnf(c_131,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_130]) ).
cnf(c_331,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_56,c_125]) ).
cnf(c_340,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_56,c_131]) ).
cnf(c_351,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_113,c_58]) ).
cnf(c_484,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_331,c_58]) ).
cnf(c_625,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_340,c_56]) ).
cnf(c_632,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_625,c_58]) ).
cnf(c_1263,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_56,c_484]) ).
cnf(c_5064,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_119,c_632]) ).
cnf(c_5554,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_5064,c_351]) ).
cnf(c_5599,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_5554,c_1263]) ).
cnf(c_5756,plain,
( ~ theorem(X0)
| theorem(not(not(X0))) ),
inference(superposition,[status(thm)],[c_5599,c_58]) ).
cnf(c_5840,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(not(and(X0,X1))) ),
inference(superposition,[status(thm)],[c_101,c_5756]) ).
cnf(c_5889,plain,
theorem(not(and(X0,not(X0)))),
inference(superposition,[status(thm)],[c_5599,c_5840]) ).
cnf(c_5951,plain,
theorem(not(and(p,not(p)))),
inference(instantiation,[status(thm)],[c_5889]) ).
cnf(c_5952,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5951,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL239-3 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n019.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 19:17:59 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 4.39/1.15 % SZS status Started for theBenchmark.p
% 4.39/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 4.39/1.15
% 4.39/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.39/1.15
% 4.39/1.15 ------ iProver source info
% 4.39/1.15
% 4.39/1.15 git: date: 2024-05-02 19:28:25 +0000
% 4.39/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.39/1.15 git: non_committed_changes: false
% 4.39/1.15
% 4.39/1.15 ------ Parsing...successful
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15 ------ 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
% 4.39/1.15
% 4.39/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.39/1.15
% 4.39/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.39/1.15 ------ Proving...
% 4.39/1.15 ------ Problem Properties
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15 clauses 12
% 4.39/1.15 conjectures 1
% 4.39/1.15 EPR 1
% 4.39/1.15 Horn 12
% 4.39/1.15 unary 11
% 4.39/1.15 binary 0
% 4.39/1.15 lits 14
% 4.39/1.15 lits eq 5
% 4.39/1.15 fd_pure 0
% 4.39/1.15 fd_pseudo 0
% 4.39/1.15 fd_cond 0
% 4.39/1.15 fd_pseudo_cond 0
% 4.39/1.15 AC symbols 0
% 4.39/1.15
% 4.39/1.15 ------ Schedule dynamic 5 is on
% 4.39/1.15
% 4.39/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15 ------
% 4.39/1.15 Current options:
% 4.39/1.15 ------
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15 ------ Proving...
% 4.39/1.15
% 4.39/1.15
% 4.39/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 4.39/1.15
% 4.39/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.39/1.15
% 4.39/1.15
%------------------------------------------------------------------------------