TSTP Solution File: SYN401+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN401+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 Sep 1 03:06:54 EDT 2023
% Result : Theorem 0.49s 1.20s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 0 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 12 ( 1 sgn; 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ! [X1] : f(X1)
=> f(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish229) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ! [X1] : f(X1)
=> f(X0) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0] :
( ~ f(X0)
& ! [X1] : f(X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( ~ f(X0)
& ! [X1] : f(X1) )
=> ( ~ f(sK0)
& ! [X1] : f(X1) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ~ f(sK0)
& ! [X1] : f(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).
fof(f6,plain,
! [X1] : f(X1),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
~ f(sK0),
inference(cnf_transformation,[],[f5]) ).
cnf(c_49,negated_conjecture,
~ f(sK0),
inference(cnf_transformation,[],[f7]) ).
cnf(c_50,negated_conjecture,
f(X0),
inference(cnf_transformation,[],[f6]) ).
cnf(c_51,plain,
f(sK0),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_52,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_49,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN401+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 19:40:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.49/1.20 % SZS status Started for theBenchmark.p
% 0.49/1.20 % SZS status Theorem for theBenchmark.p
% 0.49/1.20
% 0.49/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.49/1.20
% 0.49/1.20 ------ iProver source info
% 0.49/1.20
% 0.49/1.20 git: date: 2023-05-31 18:12:56 +0000
% 0.49/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.49/1.20 git: non_committed_changes: false
% 0.49/1.20 git: last_make_outside_of_git: false
% 0.49/1.20
% 0.49/1.20 ------ Parsing...
% 0.49/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.49/1.20
% 0.49/1.20
% 0.49/1.20 ------ Preprocessing...
% 0.49/1.20
% 0.49/1.20 % SZS status Theorem for theBenchmark.p
% 0.49/1.20
% 0.49/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.20
% 0.49/1.20
%------------------------------------------------------------------------------