TSTP Solution File: SYN062+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN062+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 Sep 1 03:05:00 EDT 2023
% Result : Theorem 0.44s 1.15s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 32 ~; 25 |; 15 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn; 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ( ( big_h(X0)
| big_g(X0) )
& big_f(X0) )
=> big_i(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_1) ).
fof(f2,axiom,
! [X0] :
( ( big_h(X0)
& big_i(X0) )
=> big_j(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_2) ).
fof(f3,axiom,
! [X0] :
( big_k(X0)
=> big_h(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_3) ).
fof(f4,conjecture,
! [X0] :
( ( big_k(X0)
& big_f(X0) )
=> big_j(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( ( big_k(X0)
& big_f(X0) )
=> big_j(X0) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ( big_h(X0)
& big_f(X0) )
=> big_i(X0) ),
inference(pure_predicate_removal,[],[f1]) ).
fof(f7,plain,
! [X0] :
( big_i(X0)
| ~ big_h(X0)
| ~ big_f(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f8,plain,
! [X0] :
( big_i(X0)
| ~ big_h(X0)
| ~ big_f(X0) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0] :
( big_j(X0)
| ~ big_h(X0)
| ~ big_i(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f10,plain,
! [X0] :
( big_j(X0)
| ~ big_h(X0)
| ~ big_i(X0) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0] :
( big_h(X0)
| ~ big_k(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
? [X0] :
( ~ big_j(X0)
& big_k(X0)
& big_f(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f13,plain,
? [X0] :
( ~ big_j(X0)
& big_k(X0)
& big_f(X0) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
( ? [X0] :
( ~ big_j(X0)
& big_k(X0)
& big_f(X0) )
=> ( ~ big_j(sK0)
& big_k(sK0)
& big_f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ~ big_j(sK0)
& big_k(sK0)
& big_f(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f14]) ).
fof(f16,plain,
! [X0] :
( big_i(X0)
| ~ big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
! [X0] :
( big_j(X0)
| ~ big_h(X0)
| ~ big_i(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f18,plain,
! [X0] :
( big_h(X0)
| ~ big_k(X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f19,plain,
big_f(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
big_k(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
~ big_j(sK0),
inference(cnf_transformation,[],[f15]) ).
cnf(c_49,plain,
( ~ big_h(X0)
| ~ big_f(X0)
| big_i(X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,plain,
( ~ big_i(X0)
| ~ big_h(X0)
| big_j(X0) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,plain,
( ~ big_k(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_52,negated_conjecture,
~ big_j(sK0),
inference(cnf_transformation,[],[f21]) ).
cnf(c_53,negated_conjecture,
big_k(sK0),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,negated_conjecture,
big_f(sK0),
inference(cnf_transformation,[],[f19]) ).
cnf(c_55,plain,
( ~ big_k(sK0)
| big_h(sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_56,plain,
( ~ big_i(sK0)
| ~ big_h(sK0)
| big_j(sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_57,plain,
( ~ big_h(sK0)
| ~ big_f(sK0)
| big_i(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_58,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_57,c_56,c_55,c_52,c_53,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sat Aug 26 18:09:11 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.44/1.15 % SZS status Started for theBenchmark.p
% 0.44/1.15 % SZS status Theorem for theBenchmark.p
% 0.44/1.15
% 0.44/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.44/1.15
% 0.44/1.15 ------ iProver source info
% 0.44/1.15
% 0.44/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.44/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.44/1.15 git: non_committed_changes: false
% 0.44/1.15 git: last_make_outside_of_git: false
% 0.44/1.15
% 0.44/1.15 ------ Parsing...
% 0.44/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 ------ Preprocessing...
% 0.44/1.15
% 0.44/1.15 % SZS status Theorem for theBenchmark.p
% 0.44/1.15
% 0.44/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.15
% 0.44/1.15
%------------------------------------------------------------------------------