TSTP Solution File: LCL231-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL231-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:23 EDT 2023
% Result : Unsatisfiable 141.83s 19.78s
% Output : CNFRefutation 141.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of clauses : 45 ( 29 unt; 0 nHn; 16 RR)
% Number of literals : 64 ( 5 equ; 20 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; 3 con; 0-2 aty)
% Number of variables : 114 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_51,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,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_96,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).
cnf(c_97,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_96]) ).
cnf(c_102,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_103,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_102]) ).
cnf(c_114,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_115,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_114]) ).
cnf(c_120,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_56]) ).
cnf(c_121,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_120]) ).
cnf(c_274,plain,
theorem(implies(or(not(X0),or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_115]) ).
cnf(c_275,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_274,c_55]) ).
cnf(c_365,plain,
theorem(implies(implies(X0,or(not(X1),X2)),implies(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_275]) ).
cnf(c_367,plain,
theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_365,c_55]) ).
cnf(c_515,plain,
( ~ theorem(implies(X0,implies(X1,X2)))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_367,c_57]) ).
cnf(c_549,plain,
theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_55,c_121]) ).
cnf(c_552,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_549,c_55]) ).
cnf(c_565,plain,
theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(superposition,[status(thm)],[c_552,c_515]) ).
cnf(c_1517,plain,
theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_55,c_121]) ).
cnf(c_1519,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_1517,c_55]) ).
cnf(c_1523,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(implies(X2,X0),implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_1519,c_57]) ).
cnf(c_1524,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X2,X0))
| theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_1523,c_57]) ).
cnf(c_1561,plain,
( ~ theorem(implies(X0,implies(X1,implies(X2,X3))))
| theorem(implies(X0,implies(X2,implies(X1,X3)))) ),
inference(superposition,[status(thm)],[c_367,c_1524]) ).
cnf(c_1609,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(implies(X1,X2),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_565,c_57]) ).
cnf(c_2676,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(implies(X0,X2)) ),
inference(superposition,[status(thm)],[c_1609,c_57]) ).
cnf(c_2735,plain,
( ~ theorem(implies(or(X0,X1),X2))
| theorem(implies(X1,X2)) ),
inference(superposition,[status(thm)],[c_103,c_2676]) ).
cnf(c_12635,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_97,c_57]) ).
cnf(c_12640,plain,
( ~ theorem(implies(X0,implies(X1,X2)))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_367,c_57]) ).
cnf(c_12658,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_275,c_57]) ).
cnf(c_12949,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_103,c_12658]) ).
cnf(c_12977,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_12949,c_12635]) ).
cnf(c_12984,plain,
theorem(or(X0,implies(or(X0,X1),X1))),
inference(superposition,[status(thm)],[c_12977,c_12658]) ).
cnf(c_13064,plain,
theorem(or(not(X0),implies(implies(X0,X1),X1))),
inference(superposition,[status(thm)],[c_55,c_12984]) ).
cnf(c_13069,plain,
theorem(implies(X0,implies(implies(X0,X1),X1))),
inference(demodulation,[status(thm)],[c_13064,c_55]) ).
cnf(c_26488,plain,
theorem(implies(X0,implies(implies(or(X1,X0),X2),X2))),
inference(superposition,[status(thm)],[c_13069,c_2735]) ).
cnf(c_30480,plain,
theorem(implies(X0,implies(implies(implies(X1,X0),X2),X2))),
inference(superposition,[status(thm)],[c_55,c_26488]) ).
cnf(c_31064,plain,
theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(superposition,[status(thm)],[c_30480,c_12640]) ).
cnf(c_36396,plain,
theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(superposition,[status(thm)],[c_31064,c_1561]) ).
cnf(c_36397,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_36396]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL231-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 04:54:30 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 141.83/19.78 % SZS status Started for theBenchmark.p
% 141.83/19.78 % SZS status Unsatisfiable for theBenchmark.p
% 141.83/19.78
% 141.83/19.78 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 141.83/19.78
% 141.83/19.78 ------ iProver source info
% 141.83/19.78
% 141.83/19.78 git: date: 2023-05-31 18:12:56 +0000
% 141.83/19.78 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 141.83/19.78 git: non_committed_changes: false
% 141.83/19.78 git: last_make_outside_of_git: false
% 141.83/19.78
% 141.83/19.78 ------ Parsing...successful
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78 ------ 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
% 141.83/19.78
% 141.83/19.78 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 141.83/19.78
% 141.83/19.78 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 141.83/19.78 ------ Proving...
% 141.83/19.78 ------ Problem Properties
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78 clauses 8
% 141.83/19.78 conjectures 1
% 141.83/19.78 EPR 0
% 141.83/19.78 Horn 8
% 141.83/19.78 unary 7
% 141.83/19.78 binary 0
% 141.83/19.78 lits 10
% 141.83/19.78 lits eq 1
% 141.83/19.78 fd_pure 0
% 141.83/19.78 fd_pseudo 0
% 141.83/19.78 fd_cond 0
% 141.83/19.78 fd_pseudo_cond 0
% 141.83/19.78 AC symbols 0
% 141.83/19.78
% 141.83/19.78 ------ Input Options Time Limit: Unbounded
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78 ------
% 141.83/19.78 Current options:
% 141.83/19.78 ------
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78 ------ Proving...
% 141.83/19.78
% 141.83/19.78
% 141.83/19.78 % SZS status Unsatisfiable for theBenchmark.p
% 141.83/19.78
% 141.83/19.78 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 141.83/19.78
% 141.83/19.78
%------------------------------------------------------------------------------