TSTP Solution File: LCL227-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL227-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:21 EDT 2024
% Result : Unsatisfiable 57.84s 8.75s
% Output : CNFRefutation 57.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 15 unt; 0 nHn; 15 RR)
% Number of literals : 53 ( 0 equ; 23 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(q),or(not(r),s))),or(not(or(p,q)),or(not(or(p,r)),or(p,s))))),
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_354,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_52,c_55]) ).
cnf(c_376,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c_56,c_50]) ).
cnf(c_378,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[c_56,c_51]) ).
cnf(c_380,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[c_56,c_52]) ).
cnf(c_446,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[c_53,c_56]) ).
cnf(c_451,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(resolution,[status(thm)],[c_54,c_56]) ).
cnf(c_464,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(resolution,[status(thm)],[c_57,c_51]) ).
cnf(c_466,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_467,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_468,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_534,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(resolution,[status(thm)],[c_446,c_378]) ).
cnf(c_1158,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X0,or(X3,X1))),or(X3,X2))) ),
inference(resolution,[status(thm)],[c_467,c_451]) ).
cnf(c_1267,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(not(X3),X1)),or(not(or(X0,X3)),X2))) ),
inference(resolution,[status(thm)],[c_468,c_451]) ).
cnf(c_1385,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_534,c_376]) ).
cnf(c_6571,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X3,X1)),or(X3,X2))) ),
inference(resolution,[status(thm)],[c_1158,c_464]) ).
cnf(c_6773,plain,
~ theorem(or(not(or(p,or(not(r),s))),or(not(or(p,r)),or(p,s)))),
inference(resolution,[status(thm)],[c_1267,c_49]) ).
cnf(c_6782,plain,
( ~ theorem(or(not(or(X0,or(X1,X2))),X3))
| theorem(or(not(or(X1,or(not(X4),X2))),or(not(or(X0,X4)),X3))) ),
inference(resolution,[status(thm)],[c_1267,c_467]) ).
cnf(c_21035,plain,
theorem(or(not(or(X0,X1)),or(X0,or(X1,X2)))),
inference(resolution,[status(thm)],[c_6571,c_354]) ).
cnf(c_22561,plain,
theorem(or(X0,or(not(or(X0,X1)),or(X1,X2)))),
inference(resolution,[status(thm)],[c_21035,c_446]) ).
cnf(c_22980,plain,
theorem(or(or(not(or(X0,X1)),or(X1,X2)),X0)),
inference(resolution,[status(thm)],[c_22561,c_380]) ).
cnf(c_23577,plain,
theorem(or(not(or(or(X0,X1),X0)),or(X0,X1))),
inference(resolution,[status(thm)],[c_22980,c_1385]) ).
cnf(c_24934,plain,
theorem(or(not(or(X0,or(X0,X1))),or(X0,X1))),
inference(resolution,[status(thm)],[c_23577,c_466]) ).
cnf(c_44409,plain,
~ theorem(or(not(or(p,or(p,s))),or(p,s))),
inference(resolution,[status(thm)],[c_6782,c_6773]) ).
cnf(c_44686,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_44409,c_24934]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL227-1 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n004.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 18:54:48 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/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
% 57.84/8.75 % SZS status Started for theBenchmark.p
% 57.84/8.75 % SZS status Unsatisfiable for theBenchmark.p
% 57.84/8.75
% 57.84/8.75 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 57.84/8.75
% 57.84/8.75 ------ iProver source info
% 57.84/8.75
% 57.84/8.75 git: date: 2024-05-02 19:28:25 +0000
% 57.84/8.75 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 57.84/8.75 git: non_committed_changes: false
% 57.84/8.75
% 57.84/8.75 ------ Parsing...successful
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 57.84/8.75
% 57.84/8.75 ------ Preprocessing...
% 57.84/8.75 ------ Proving...
% 57.84/8.75 ------ Problem Properties
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75 clauses 9
% 57.84/8.75 conjectures 1
% 57.84/8.75 EPR 1
% 57.84/8.75 Horn 9
% 57.84/8.75 unary 6
% 57.84/8.75 binary 1
% 57.84/8.75 lits 14
% 57.84/8.75 lits eq 0
% 57.84/8.75 fd_pure 0
% 57.84/8.75 fd_pseudo 0
% 57.84/8.75 fd_cond 0
% 57.84/8.75 fd_pseudo_cond 0
% 57.84/8.75 AC symbols 0
% 57.84/8.75
% 57.84/8.75 ------ Input Options Time Limit: Unbounded
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75 ------
% 57.84/8.75 Current options:
% 57.84/8.75 ------
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75 ------ Proving...
% 57.84/8.75
% 57.84/8.75
% 57.84/8.75 % SZS status Unsatisfiable for theBenchmark.p
% 57.84/8.75
% 57.84/8.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 57.84/8.75
% 57.84/8.75
%------------------------------------------------------------------------------