TSTP Solution File: SYN402+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN402+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 03:30:30 EDT 2024
% Result : Theorem 0.73s 1.19s
% Output : CNFRefutation 0.73s
% 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 : 15 ( 8 ~; 0 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( f(X0)
=> ? [X1] : f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish230) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( f(X0)
=> ? [X1] : f(X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0] :
( ! [X1] : ~ f(X1)
& f(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( ! [X1] : ~ f(X1)
& f(X0) )
=> ( ! [X1] : ~ f(X1)
& f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ! [X1] : ~ f(X1)
& f(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).
fof(f6,plain,
f(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X1] : ~ f(X1),
inference(cnf_transformation,[],[f5]) ).
cnf(c_49,negated_conjecture,
~ f(X0),
inference(cnf_transformation,[],[f7]) ).
cnf(c_50,negated_conjecture,
f(sK0),
inference(cnf_transformation,[],[f6]) ).
cnf(c_51,plain,
~ f(sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_52,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_51,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN402+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.15 % Command : run_iprover %s %d THM
% 0.14/0.37 % Computer : n017.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu May 2 20:35:06 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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
% 0.73/1.19 % SZS status Started for theBenchmark.p
% 0.73/1.19 % SZS status Theorem for theBenchmark.p
% 0.73/1.19
% 0.73/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.73/1.19
% 0.73/1.19 ------ iProver source info
% 0.73/1.19
% 0.73/1.19 git: date: 2024-05-02 19:28:25 +0000
% 0.73/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.73/1.19 git: non_committed_changes: false
% 0.73/1.19
% 0.73/1.19 ------ Parsing...
% 0.73/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.73/1.19
% 0.73/1.19
% 0.73/1.19 ------ Preprocessing...
% 0.73/1.19
% 0.73/1.19 % SZS status Theorem for theBenchmark.p
% 0.73/1.19
% 0.73/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.20
% 0.73/1.20
%------------------------------------------------------------------------------