TSTP Solution File: SYN070+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN070+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 May 3 03:29:08 EDT 2024
% Result : Theorem 0.78s 1.21s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 6 unt; 0 def)
% Number of atoms : 150 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 181 ( 72 ~; 66 |; 32 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 56 ( 1 sgn 34 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( ( ( big_h(X1,X0)
& big_f(X1) )
=> big_g(X1) )
& big_f(X0) )
=> big_g(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_1) ).
fof(f2,axiom,
( ? [X0] :
( ~ big_g(X0)
& big_f(X0) )
=> ? [X2] :
( ! [X1] :
( ( ~ big_g(X1)
& big_f(X1) )
=> big_j(X2,X1) )
& ~ big_g(X2)
& big_f(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_2) ).
fof(f3,axiom,
! [X0,X1] :
( ( big_h(X0,X1)
& big_f(X1)
& big_f(X0) )
=> ~ big_j(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_3) ).
fof(f4,conjecture,
! [X0] :
( big_f(X0)
=> big_g(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( big_f(X0)
=> big_g(X0) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ~ big_g(X0)
& big_f(X0) )
=> ? [X1] :
( ! [X2] :
( ( ~ big_g(X2)
& big_f(X2) )
=> big_j(X1,X2) )
& ~ big_g(X1)
& big_f(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f7,plain,
! [X0,X1] :
( big_g(X0)
| ( ~ big_g(X1)
& big_h(X1,X0)
& big_f(X1) )
| ~ big_f(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( big_g(X0)
| ( ~ big_g(X1)
& big_h(X1,X0)
& big_f(X1) )
| ~ big_f(X0) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
( ? [X1] :
( ! [X2] :
( big_j(X1,X2)
| big_g(X2)
| ~ big_f(X2) )
& ~ big_g(X1)
& big_f(X1) )
| ! [X0] :
( big_g(X0)
| ~ big_f(X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f10,plain,
( ? [X1] :
( ! [X2] :
( big_j(X1,X2)
| big_g(X2)
| ~ big_f(X2) )
& ~ big_g(X1)
& big_f(X1) )
| ! [X0] :
( big_g(X0)
| ~ big_f(X0) ) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_j(X1,X0)
| ~ big_h(X0,X1)
| ~ big_f(X1)
| ~ big_f(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
! [X0,X1] :
( ~ big_j(X1,X0)
| ~ big_h(X0,X1)
| ~ big_f(X1)
| ~ big_f(X0) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
? [X0] :
( ~ big_g(X0)
& big_f(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f14,plain,
( ? [X0] :
( ! [X1] :
( big_j(X0,X1)
| big_g(X1)
| ~ big_f(X1) )
& ~ big_g(X0)
& big_f(X0) )
| ! [X2] :
( big_g(X2)
| ~ big_f(X2) ) ),
inference(rectify,[],[f10]) ).
fof(f15,plain,
( ? [X0] :
( ! [X1] :
( big_j(X0,X1)
| big_g(X1)
| ~ big_f(X1) )
& ~ big_g(X0)
& big_f(X0) )
=> ( ! [X1] :
( big_j(sK0,X1)
| big_g(X1)
| ~ big_f(X1) )
& ~ big_g(sK0)
& big_f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ! [X1] :
( big_j(sK0,X1)
| big_g(X1)
| ~ big_f(X1) )
& ~ big_g(sK0)
& big_f(sK0) )
| ! [X2] :
( big_g(X2)
| ~ big_f(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f17,plain,
( ? [X0] :
( ~ big_g(X0)
& big_f(X0) )
=> ( ~ big_g(sK1)
& big_f(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ~ big_g(sK1)
& big_f(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f17]) ).
fof(f20,plain,
! [X0,X1] :
( big_g(X0)
| big_h(X1,X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f22,plain,
! [X2] :
( big_f(sK0)
| big_g(X2)
| ~ big_f(X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
! [X2] :
( ~ big_g(sK0)
| big_g(X2)
| ~ big_f(X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X2,X1] :
( big_j(sK0,X1)
| big_g(X1)
| ~ big_f(X1)
| big_g(X2)
| ~ big_f(X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
! [X0,X1] :
( ~ big_j(X1,X0)
| ~ big_h(X0,X1)
| ~ big_f(X1)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
big_f(sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
~ big_g(sK1),
inference(cnf_transformation,[],[f18]) ).
cnf(c_50,plain,
( ~ big_f(X0)
| big_h(X1,X0)
| big_g(X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_52,plain,
( ~ big_f(X0)
| ~ big_f(X1)
| big_j(sK0,X0)
| big_g(X0)
| big_g(X1) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_53,plain,
( ~ big_f(X0)
| ~ big_g(sK0)
| big_g(X0) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_54,plain,
( ~ big_f(X0)
| big_g(X0)
| big_f(sK0) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_55,plain,
( ~ big_h(X0,X1)
| ~ big_j(X1,X0)
| ~ big_f(X0)
| ~ big_f(X1) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,negated_conjecture,
~ big_g(sK1),
inference(cnf_transformation,[],[f27]) ).
cnf(c_57,negated_conjecture,
big_f(sK1),
inference(cnf_transformation,[],[f26]) ).
cnf(c_58,plain,
( ~ big_f(sK0)
| big_h(sK0,sK0)
| big_g(sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_59,plain,
( ~ big_f(sK0)
| big_j(sK0,sK0)
| big_g(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_60,plain,
( ~ big_h(sK0,sK0)
| ~ big_j(sK0,sK0)
| ~ big_f(sK0) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_61,plain,
( big_g(X0)
| ~ big_f(X0) ),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_53,c_58,c_59,c_60]) ).
cnf(c_62,plain,
( ~ big_f(X0)
| big_g(X0) ),
inference(renaming,[status(thm)],[c_61]) ).
cnf(c_70,plain,
( big_g(X0)
| ~ big_f(X0) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_62]) ).
cnf(c_71,plain,
( ~ big_f(X0)
| big_g(X0) ),
inference(renaming,[status(thm)],[c_70]) ).
cnf(c_88,plain,
~ big_f(sK1),
inference(resolution,[status(thm)],[c_71,c_56]) ).
cnf(c_89,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_88,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN070+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 21:10:52 EDT 2024
% 0.19/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.78/1.21 % SZS status Started for theBenchmark.p
% 0.78/1.21 % SZS status Theorem for theBenchmark.p
% 0.78/1.21
% 0.78/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.78/1.21
% 0.78/1.21 ------ iProver source info
% 0.78/1.21
% 0.78/1.21 git: date: 2024-05-02 19:28:25 +0000
% 0.78/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.78/1.21 git: non_committed_changes: false
% 0.78/1.21
% 0.78/1.21 ------ Parsing...
% 0.78/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.78/1.21
% 0.78/1.21
% 0.78/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s
% 0.78/1.21
% 0.78/1.21 % SZS status Theorem for theBenchmark.p
% 0.78/1.21
% 0.78/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.21
% 0.78/1.21
%------------------------------------------------------------------------------