TSTP Solution File: LCL365-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL365-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:44:04 EDT 2023
% Result : Unsatisfiable 28.36s 4.59s
% Output : CNFRefutation 28.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 50 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c_50,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(c_51,plain,
is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(c_52,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(c_53,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_14) ).
cnf(c_124,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_49,c_52]) ).
cnf(c_175,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
inference(resolution,[status(thm)],[c_50,c_49]) ).
cnf(c_189,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[status(thm)],[c_175,c_49]) ).
cnf(c_201,plain,
~ is_a_theorem(implies(implies(not(z),y),implies(x,implies(implies(y,z),z)))),
inference(resolution,[status(thm)],[c_53,c_175]) ).
cnf(c_224,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,implies(implies(X2,X3),implies(X1,X3)))) ),
inference(resolution,[status(thm)],[c_189,c_50]) ).
cnf(c_226,plain,
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_189,c_51]) ).
cnf(c_227,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[status(thm)],[c_189,c_52]) ).
cnf(c_229,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(X0,implies(X3,X2))) ),
inference(resolution,[status(thm)],[c_189,c_175]) ).
cnf(c_303,plain,
is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[status(thm)],[c_226,c_51]) ).
cnf(c_359,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[status(thm)],[c_227,c_49]) ).
cnf(c_523,plain,
( ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(implies(X1,implies(X0,X2))) ),
inference(resolution,[status(thm)],[c_229,c_52]) ).
cnf(c_527,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X3,implies(X4,X1)))
| is_a_theorem(implies(X3,implies(X0,implies(X4,X2)))) ),
inference(resolution,[status(thm)],[c_229,c_224]) ).
cnf(c_922,plain,
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[status(thm)],[c_523,c_226]) ).
cnf(c_986,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[status(thm)],[c_922,c_124]) ).
cnf(c_1002,plain,
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[status(thm)],[c_986,c_226]) ).
cnf(c_1533,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(not(implies(X2,X1)),X3)) ),
inference(resolution,[status(thm)],[c_359,c_175]) ).
cnf(c_4856,plain,
( ~ is_a_theorem(implies(X0,implies(implies(X1,X2),X3)))
| is_a_theorem(implies(implies(X1,X4),implies(X0,implies(implies(X4,X2),X3)))) ),
inference(resolution,[status(thm)],[c_527,c_50]) ).
cnf(c_15180,plain,
( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
| is_a_theorem(implies(not(implies(X0,X2)),X3)) ),
inference(resolution,[status(thm)],[c_1533,c_52]) ).
cnf(c_62646,plain,
is_a_theorem(implies(not(implies(implies(not(X0),X0),X0)),X1)),
inference(resolution,[status(thm)],[c_15180,c_303]) ).
cnf(c_73332,plain,
is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[status(thm)],[c_62646,c_1002]) ).
cnf(c_79520,plain,
~ is_a_theorem(implies(x,implies(implies(not(z),z),z))),
inference(resolution,[status(thm)],[c_4856,c_201]) ).
cnf(c_80296,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_79520,c_73332]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : LCL365-1 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Fri Aug 25 01:30:12 EDT 2023
% 0.07/0.28 % CPUTime :
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 28.36/4.59 % SZS status Started for theBenchmark.p
% 28.36/4.59 % SZS status Unsatisfiable for theBenchmark.p
% 28.36/4.59
% 28.36/4.59 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 28.36/4.59
% 28.36/4.59 ------ iProver source info
% 28.36/4.59
% 28.36/4.59 git: date: 2023-05-31 18:12:56 +0000
% 28.36/4.59 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 28.36/4.59 git: non_committed_changes: false
% 28.36/4.59 git: last_make_outside_of_git: false
% 28.36/4.59
% 28.36/4.59 ------ Parsing...successful
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 28.36/4.59
% 28.36/4.59 ------ Preprocessing...
% 28.36/4.59 ------ Proving...
% 28.36/4.59 ------ Problem Properties
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59 clauses 5
% 28.36/4.59 conjectures 1
% 28.36/4.59 EPR 0
% 28.36/4.59 Horn 5
% 28.36/4.59 unary 4
% 28.36/4.59 binary 0
% 28.36/4.59 lits 7
% 28.36/4.59 lits eq 0
% 28.36/4.59 fd_pure 0
% 28.36/4.59 fd_pseudo 0
% 28.36/4.59 fd_cond 0
% 28.36/4.59 fd_pseudo_cond 0
% 28.36/4.59 AC symbols 0
% 28.36/4.59
% 28.36/4.59 ------ Input Options Time Limit: Unbounded
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59 ------
% 28.36/4.59 Current options:
% 28.36/4.59 ------
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59 ------ Proving...
% 28.36/4.59
% 28.36/4.59
% 28.36/4.59 % SZS status Unsatisfiable for theBenchmark.p
% 28.36/4.59
% 28.36/4.59 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 28.36/4.59
% 28.36/4.59
%------------------------------------------------------------------------------