TSTP Solution File: SYN057+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN057+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:28:51 EDT 2024
% Result : Theorem 0.70s 1.19s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 9 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 102 ( 48 ~; 36 |; 10 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 16 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( ~ big_g(X0)
& big_f(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_1) ).
fof(f2,axiom,
! [X0] :
( big_f(X0)
=> big_h(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_2) ).
fof(f3,axiom,
! [X0] :
( ( big_i(X0)
& big_j(X0) )
=> big_f(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_3) ).
fof(f4,axiom,
( ? [X0] :
( ~ big_g(X0)
& big_h(X0) )
=> ! [X1] :
( big_i(X1)
=> ~ big_h(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_4) ).
fof(f5,conjecture,
! [X0] :
( big_j(X0)
=> ~ big_i(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27) ).
fof(f6,negated_conjecture,
~ ! [X0] :
( big_j(X0)
=> ~ big_i(X0) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,plain,
! [X0] :
( big_h(X0)
| ~ big_f(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
! [X0] :
( big_f(X0)
| ~ big_i(X0)
| ~ big_j(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f9,plain,
! [X0] :
( big_f(X0)
| ~ big_i(X0)
| ~ big_j(X0) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
( ! [X1] :
( ~ big_h(X1)
| ~ big_i(X1) )
| ! [X0] :
( big_g(X0)
| ~ big_h(X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f11,plain,
? [X0] :
( big_i(X0)
& big_j(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f12,plain,
( ? [X0] :
( ~ big_g(X0)
& big_f(X0) )
=> ( ~ big_g(sK0)
& big_f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ~ big_g(sK0)
& big_f(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f12]) ).
fof(f14,plain,
( ! [X0] :
( ~ big_h(X0)
| ~ big_i(X0) )
| ! [X1] :
( big_g(X1)
| ~ big_h(X1) ) ),
inference(rectify,[],[f10]) ).
fof(f15,plain,
( ? [X0] :
( big_i(X0)
& big_j(X0) )
=> ( big_i(sK1)
& big_j(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( big_i(sK1)
& big_j(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f15]) ).
fof(f17,plain,
big_f(sK0),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
~ big_g(sK0),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X0] :
( big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f20,plain,
! [X0] :
( big_f(X0)
| ~ big_i(X0)
| ~ big_j(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
! [X0,X1] :
( ~ big_h(X0)
| ~ big_i(X0)
| big_g(X1)
| ~ big_h(X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
big_j(sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
big_i(sK1),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
~ big_g(sK0),
inference(cnf_transformation,[],[f18]) ).
cnf(c_50,plain,
big_f(sK0),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,plain,
( ~ big_f(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
( ~ big_i(X0)
| ~ big_j(X0)
| big_f(X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_53,plain,
( ~ big_h(X0)
| ~ big_h(X1)
| ~ big_i(X0)
| big_g(X1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,negated_conjecture,
big_i(sK1),
inference(cnf_transformation,[],[f23]) ).
cnf(c_55,negated_conjecture,
big_j(sK1),
inference(cnf_transformation,[],[f22]) ).
cnf(c_56,plain,
( ~ big_f(sK0)
| big_h(sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_58,plain,
( ~ big_h(X0)
| big_g(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_53]) ).
cnf(c_59,plain,
( ~ big_i(X0)
| ~ big_h(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_53]) ).
cnf(c_60,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).
cnf(c_63,plain,
( ~ big_h(sK0)
| ~ sP0_iProver_def
| big_g(sK0) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_65,plain,
( ~ big_h(sK1)
| ~ big_i(sK1)
| ~ sP1_iProver_def ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_66,plain,
( ~ big_f(sK1)
| big_h(sK1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_67,plain,
( ~ big_i(sK1)
| ~ big_j(sK1)
| big_f(sK1) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_68,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_67,c_66,c_65,c_63,c_60,c_56,c_49,c_50,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : SYN057+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.16 % Command : run_iprover %s %d THM
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8042.1875MB
% 0.11/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu May 2 21:14:42 EDT 2024
% 0.11/0.38 % CPUTime :
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.70/1.19 % SZS status Started for theBenchmark.p
% 0.70/1.19 % SZS status Theorem for theBenchmark.p
% 0.70/1.19
% 0.70/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.70/1.19
% 0.70/1.19 ------ iProver source info
% 0.70/1.19
% 0.70/1.19 git: date: 2024-05-02 19:28:25 +0000
% 0.70/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.70/1.19 git: non_committed_changes: false
% 0.70/1.19
% 0.70/1.19 ------ Parsing...
% 0.70/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.70/1.19
% 0.70/1.19 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.70/1.19 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.70/1.19 ------ Proving...
% 0.70/1.19 ------ Problem Properties
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19 clauses 9
% 0.70/1.19 conjectures 2
% 0.70/1.19 EPR 9
% 0.70/1.19 Horn 8
% 0.70/1.19 unary 4
% 0.70/1.19 binary 2
% 0.70/1.19 lits 17
% 0.70/1.19 lits eq 0
% 0.70/1.19 fd_pure 0
% 0.70/1.19 fd_pseudo 0
% 0.70/1.19 fd_cond 0
% 0.70/1.19 fd_pseudo_cond 0
% 0.70/1.19 AC symbols 0
% 0.70/1.19
% 0.70/1.19 ------ Schedule EPR non Horn non eq is on
% 0.70/1.19
% 0.70/1.19 ------ no equalities: superposition off
% 0.70/1.19
% 0.70/1.19 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19 ------
% 0.70/1.19 Current options:
% 0.70/1.19 ------
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19 ------ Proving...
% 0.70/1.19
% 0.70/1.19
% 0.70/1.19 % SZS status Theorem for theBenchmark.p
% 0.70/1.19
% 0.70/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.70/1.19
% 0.70/1.19
%------------------------------------------------------------------------------