TSTP Solution File: LCL210-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL210-1 : TPTP v8.1.2. Released v1.1.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:16 EDT 2024
% Result : Unsatisfiable 85.00s 12.25s
% Output : CNFRefutation 85.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 17 unt; 0 nHn; 14 RR)
% Number of literals : 43 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_412,plain,
theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_55,c_50]) ).
cnf(c_491,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[c_53,c_56]) ).
cnf(c_520,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X0,X0)),X1)) ),
inference(resolution,[status(thm)],[c_57,c_50]) ).
cnf(c_521,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(resolution,[status(thm)],[c_57,c_51]) ).
cnf(c_523,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X1,X0)),X2)) ),
inference(resolution,[status(thm)],[c_57,c_52]) ).
cnf(c_524,plain,
( ~ theorem(or(not(or(X0,or(X1,X2))),X3))
| theorem(or(not(or(X1,or(X0,X2))),X3)) ),
inference(resolution,[status(thm)],[c_57,c_53]) ).
cnf(c_525,plain,
( ~ theorem(or(not(or(not(or(X0,X1)),or(X0,X2))),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(resolution,[status(thm)],[c_57,c_54]) ).
cnf(c_1509,plain,
theorem(or(not(or(X0,or(or(X0,X1),X1))),or(X0,X1))),
inference(resolution,[status(thm)],[c_524,c_412]) ).
cnf(c_1532,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X0,or(or(X0,X1),X1))),X2)) ),
inference(resolution,[status(thm)],[c_524,c_520]) ).
cnf(c_3816,plain,
theorem(or(not(or(or(X0,X1),X1)),or(X0,X1))),
inference(resolution,[status(thm)],[c_1509,c_521]) ).
cnf(c_6525,plain,
theorem(or(not(or(X0,or(X1,X0))),or(X1,X0))),
inference(resolution,[status(thm)],[c_3816,c_523]) ).
cnf(c_6973,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(or(or(X0,X1),X1),X0)),X2)) ),
inference(resolution,[status(thm)],[c_1532,c_523]) ).
cnf(c_7535,plain,
theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))),
inference(resolution,[status(thm)],[c_6525,c_524]) ).
cnf(c_9122,plain,
theorem(or(not(or(not(X0),X1)),or(not(or(X1,X0)),X1))),
inference(resolution,[status(thm)],[c_7535,c_525]) ).
cnf(c_31546,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(X0),X2)) ),
inference(resolution,[status(thm)],[c_6973,c_521]) ).
cnf(c_102443,plain,
theorem(or(not(not(X0)),or(not(or(X1,X0)),X1))),
inference(resolution,[status(thm)],[c_9122,c_31546]) ).
cnf(c_103383,plain,
theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
inference(resolution,[status(thm)],[c_102443,c_491]) ).
cnf(c_103535,plain,
theorem(or(not(or(X0,X1)),or(not(not(X0)),X1))),
inference(resolution,[status(thm)],[c_103383,c_523]) ).
cnf(c_103783,plain,
theorem(or(not(not(X0)),or(not(or(X0,X1)),X1))),
inference(resolution,[status(thm)],[c_103535,c_491]) ).
cnf(c_104133,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_103783]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL210-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/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:06:14 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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
% 85.00/12.25 % SZS status Started for theBenchmark.p
% 85.00/12.25 % SZS status Unsatisfiable for theBenchmark.p
% 85.00/12.25
% 85.00/12.25 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 85.00/12.25
% 85.00/12.25 ------ iProver source info
% 85.00/12.25
% 85.00/12.25 git: date: 2024-05-02 19:28:25 +0000
% 85.00/12.25 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 85.00/12.25 git: non_committed_changes: false
% 85.00/12.25
% 85.00/12.25 ------ Parsing...successful
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 85.00/12.25
% 85.00/12.25 ------ Preprocessing...
% 85.00/12.25 ------ Proving...
% 85.00/12.25 ------ Problem Properties
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25 clauses 9
% 85.00/12.25 conjectures 1
% 85.00/12.25 EPR 1
% 85.00/12.25 Horn 9
% 85.00/12.25 unary 6
% 85.00/12.25 binary 1
% 85.00/12.25 lits 14
% 85.00/12.25 lits eq 0
% 85.00/12.25 fd_pure 0
% 85.00/12.25 fd_pseudo 0
% 85.00/12.25 fd_cond 0
% 85.00/12.25 fd_pseudo_cond 0
% 85.00/12.25 AC symbols 0
% 85.00/12.25
% 85.00/12.25 ------ Input Options Time Limit: Unbounded
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25 ------
% 85.00/12.25 Current options:
% 85.00/12.25 ------
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25 ------ Proving...
% 85.00/12.25
% 85.00/12.25
% 85.00/12.25 % SZS status Unsatisfiable for theBenchmark.p
% 85.00/12.25
% 85.00/12.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 85.00/12.25
% 85.00/12.25
%------------------------------------------------------------------------------