TSTP Solution File: LCL224-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL224-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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:19 EDT 2023
% Result : Unsatisfiable 50.35s 7.74s
% Output : CNFRefutation 50.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 52 ( 0 equ; 22 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_381,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_52,c_55]) ).
cnf(c_409,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c_56,c_50]) ).
cnf(c_411,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[c_56,c_51]) ).
cnf(c_413,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[c_56,c_52]) ).
cnf(c_462,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[c_53,c_56]) ).
cnf(c_502,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_510,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(resolution,[status(thm)],[c_57,c_51]) ).
cnf(c_512,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_513,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_514,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_891,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(resolution,[status(thm)],[c_462,c_411]) ).
cnf(c_1428,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X0,or(X3,X1))),or(X3,X2))) ),
inference(resolution,[status(thm)],[c_513,c_502]) ).
cnf(c_1531,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_514,c_502]) ).
cnf(c_1704,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_891,c_409]) ).
cnf(c_6858,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X3,X1)),or(X3,X2))) ),
inference(resolution,[status(thm)],[c_1428,c_510]) ).
cnf(c_7466,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_1531,c_513]) ).
cnf(c_22002,plain,
theorem(or(not(or(X0,X1)),or(X0,or(X1,X2)))),
inference(resolution,[status(thm)],[c_6858,c_381]) ).
cnf(c_23569,plain,
theorem(or(X0,or(not(or(X0,X1)),or(X1,X2)))),
inference(resolution,[status(thm)],[c_22002,c_462]) ).
cnf(c_23907,plain,
theorem(or(or(not(or(X0,X1)),or(X1,X2)),X0)),
inference(resolution,[status(thm)],[c_23569,c_413]) ).
cnf(c_24578,plain,
theorem(or(not(or(or(X0,X1),X0)),or(X0,X1))),
inference(resolution,[status(thm)],[c_23907,c_1704]) ).
cnf(c_25564,plain,
theorem(or(not(or(X0,or(X0,X1))),or(X0,X1))),
inference(resolution,[status(thm)],[c_24578,c_512]) ).
cnf(c_53728,plain,
~ theorem(or(not(or(p,or(p,r))),or(p,r))),
inference(resolution,[status(thm)],[c_7466,c_49]) ).
cnf(c_54709,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_53728,c_25564]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL224-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n001.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Fri Aug 25 02:58:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 50.35/7.74 % SZS status Started for theBenchmark.p
% 50.35/7.74 % SZS status Unsatisfiable for theBenchmark.p
% 50.35/7.74
% 50.35/7.74 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 50.35/7.74
% 50.35/7.74 ------ iProver source info
% 50.35/7.74
% 50.35/7.74 git: date: 2023-05-31 18:12:56 +0000
% 50.35/7.74 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 50.35/7.74 git: non_committed_changes: false
% 50.35/7.74 git: last_make_outside_of_git: false
% 50.35/7.74
% 50.35/7.74 ------ Parsing...successful
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 50.35/7.74
% 50.35/7.74 ------ Preprocessing...
% 50.35/7.74 ------ Proving...
% 50.35/7.74 ------ Problem Properties
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74 clauses 9
% 50.35/7.74 conjectures 1
% 50.35/7.74 EPR 1
% 50.35/7.74 Horn 9
% 50.35/7.74 unary 6
% 50.35/7.74 binary 1
% 50.35/7.74 lits 14
% 50.35/7.74 lits eq 0
% 50.35/7.74 fd_pure 0
% 50.35/7.74 fd_pseudo 0
% 50.35/7.74 fd_cond 0
% 50.35/7.74 fd_pseudo_cond 0
% 50.35/7.74 AC symbols 0
% 50.35/7.74
% 50.35/7.74 ------ Input Options Time Limit: Unbounded
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74 ------
% 50.35/7.74 Current options:
% 50.35/7.74 ------
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74 ------ Proving...
% 50.35/7.74
% 50.35/7.74
% 50.35/7.74 % SZS status Unsatisfiable for theBenchmark.p
% 50.35/7.74
% 50.35/7.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 50.35/7.74
% 50.35/7.74
%------------------------------------------------------------------------------