TSTP Solution File: SYN406+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN406+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 : Mon Jun 24 19:38:31 EDT 2024
% Result : Theorem 0.44s 1.14s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 67 ( 23 ~; 14 |; 23 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 13 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ? [X1] :
( h(X1)
& f(X1) )
& ! [X0] :
( f(X0)
=> g(X0) ) )
=> ? [X2] :
( h(X2)
& g(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish240) ).
fof(f2,negated_conjecture,
~ ( ( ? [X1] :
( h(X1)
& f(X1) )
& ! [X0] :
( f(X0)
=> g(X0) ) )
=> ? [X2] :
( h(X2)
& g(X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ? [X0] :
( h(X0)
& f(X0) )
& ! [X1] :
( f(X1)
=> g(X1) ) )
=> ? [X2] :
( h(X2)
& g(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X2] :
( ~ h(X2)
| ~ g(X2) )
& ? [X0] :
( h(X0)
& f(X0) )
& ! [X1] :
( g(X1)
| ~ f(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X2] :
( ~ h(X2)
| ~ g(X2) )
& ? [X0] :
( h(X0)
& f(X0) )
& ! [X1] :
( g(X1)
| ~ f(X1) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0] :
( ~ h(X0)
| ~ g(X0) )
& ? [X1] :
( h(X1)
& f(X1) )
& ! [X2] :
( g(X2)
| ~ f(X2) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X1] :
( h(X1)
& f(X1) )
=> ( h(sK0)
& f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ! [X0] :
( ~ h(X0)
| ~ g(X0) )
& h(sK0)
& f(sK0)
& ! [X2] :
( g(X2)
| ~ f(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f9,plain,
! [X2] :
( g(X2)
| ~ f(X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
f(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
h(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X0] :
( ~ h(X0)
| ~ g(X0) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ h(X0)
| ~ g(X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,negated_conjecture,
h(sK0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
f(sK0),
inference(cnf_transformation,[],[f10]) ).
cnf(c_52,negated_conjecture,
( ~ f(X0)
| g(X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_53,plain,
( ~ f(sK0)
| g(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_54,plain,
( ~ h(sK0)
| ~ g(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_55,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_54,c_53,c_50,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN406+1 : TPTP v8.2.0. Released v2.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jun 23 19:31:09 EDT 2024
% 0.18/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.44/1.14 % SZS status Started for theBenchmark.p
% 0.44/1.14 % SZS status Theorem for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.14
% 0.44/1.14 ------ iProver source info
% 0.44/1.14
% 0.44/1.14 git: date: 2024-06-12 09:56:46 +0000
% 0.44/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.44/1.14 git: non_committed_changes: false
% 0.44/1.14
% 0.44/1.14 ------ Parsing...
% 0.44/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing...
% 0.44/1.14
% 0.44/1.14 % SZS status Theorem for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.14
% 0.44/1.14
%------------------------------------------------------------------------------