TSTP Solution File: SYN061+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN061+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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.73s 1.17s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 13 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn; 7 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
~ ? [X0] :
( ( big_h(X0)
| big_g(X0) )
& big_f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_1) ).
fof(f2,axiom,
? [X0] :
( big_f(X0)
& big_i(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_2) ).
fof(f3,axiom,
! [X0] :
( ~ big_h(X0)
=> big_j(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_3) ).
fof(f4,conjecture,
? [X0] :
( big_j(X0)
& big_i(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31) ).
fof(f5,negated_conjecture,
~ ? [X0] :
( big_j(X0)
& big_i(X0) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
~ ? [X0] :
( big_h(X0)
& big_f(X0) ),
inference(pure_predicate_removal,[],[f1]) ).
fof(f7,plain,
! [X0] :
( ~ big_h(X0)
| ~ big_f(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f8,plain,
! [X0] :
( big_j(X0)
| big_h(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f9,plain,
! [X0] :
( ~ big_j(X0)
| ~ big_i(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
( ? [X0] :
( big_f(X0)
& big_i(X0) )
=> ( big_f(sK0)
& big_i(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( big_f(sK0)
& big_i(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f2,f10]) ).
fof(f12,plain,
! [X0] :
( ~ big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
big_i(sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f14,plain,
big_f(sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X0] :
( big_j(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0] :
( ~ big_j(X0)
| ~ big_i(X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,plain,
( ~ big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,plain,
big_f(sK0),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,plain,
big_i(sK0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,plain,
( big_h(X0)
| big_j(X0) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_53,negated_conjecture,
( ~ big_i(X0)
| ~ big_j(X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,plain,
( big_h(sK0)
| big_j(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_55,plain,
( ~ big_i(sK0)
| ~ big_j(sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_56,plain,
( ~ big_h(sK0)
| ~ big_f(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_57,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_56,c_55,c_54,c_50,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN061+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n029.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 18:53:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.73/1.17 % SZS status Started for theBenchmark.p
% 0.73/1.17 % SZS status Theorem for theBenchmark.p
% 0.73/1.17
% 0.73/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.73/1.17
% 0.73/1.17 ------ iProver source info
% 0.73/1.17
% 0.73/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.73/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.73/1.17 git: non_committed_changes: false
% 0.73/1.17 git: last_make_outside_of_git: false
% 0.73/1.17
% 0.73/1.17 ------ Parsing...
% 0.73/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.73/1.17
% 0.73/1.17
% 0.73/1.17 ------ Preprocessing...
% 0.73/1.17
% 0.73/1.17 % SZS status Theorem for theBenchmark.p
% 0.73/1.17
% 0.73/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.17
% 0.73/1.17
%------------------------------------------------------------------------------