TSTP Solution File: LCL506+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL506+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:48 EDT 2023
% Result : Theorem 0.97s 1.15s
% Output : CNFRefutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 14 ~; 7 |; 0 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn; 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f43,conjecture,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f44,negated_conjecture,
~ and_1,
inference(negated_conjecture,[],[f43]) ).
fof(f46,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f56,plain,
~ and_1,
inference(flattening,[],[f44]) ).
fof(f58,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f60,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
=> and_1 ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f68,plain,
( and_1
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f60]) ).
fof(f70,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f58]) ).
fof(f75,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0))
=> ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
( and_1
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f68,f75]) ).
fof(f79,plain,
( and_1
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f76]) ).
fof(f81,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f91,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f97,plain,
~ and_1,
inference(cnf_transformation,[],[f56]) ).
cnf(c_51,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK0))
| and_1 ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_53,plain,
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_63,plain,
kn2,
inference(cnf_transformation,[],[f91]) ).
cnf(c_69,negated_conjecture,
~ and_1,
inference(cnf_transformation,[],[f97]) ).
cnf(c_77,plain,
is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_53,c_63,c_53]) ).
cnf(c_83,plain,
~ is_a_theorem(implies(and(sK0,sK1),sK0)),
inference(global_subsumption_just,[status(thm)],[c_51,c_69,c_51]) ).
cnf(c_122,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_83,c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL506+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 07:17:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.97/1.15 % SZS status Started for theBenchmark.p
% 0.97/1.15 % SZS status Theorem for theBenchmark.p
% 0.97/1.15
% 0.97/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.97/1.15
% 0.97/1.15 ------ iProver source info
% 0.97/1.15
% 0.97/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.97/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.97/1.15 git: non_committed_changes: false
% 0.97/1.15 git: last_make_outside_of_git: false
% 0.97/1.15
% 0.97/1.15 ------ Parsing...
% 0.97/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.97/1.15
% 0.97/1.15 ------ Preprocessing...
% 0.97/1.15
% 0.97/1.15 % SZS status Theorem for theBenchmark.p
% 0.97/1.15
% 0.97/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.97/1.15
% 0.97/1.15
%------------------------------------------------------------------------------