TSTP Solution File: SYN318+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN318+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:06:18 EDT 2023
% Result : Theorem 1.52s 1.14s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 74 ( 29 ~; 15 |; 10 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 37 ( 7 sgn; 21 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ( p
=> ! [X1] :
( big_f(X1)
=> big_g(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_2_4) ).
fof(f2,negated_conjecture,
~ ? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ( p
=> ! [X1] :
( big_f(X1)
=> big_g(X0) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ( p
=> ! [X2] :
( big_f(X2)
=> big_g(X0) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
~ ? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ! [X2] :
( big_f(X2)
=> big_g(X0) ) ),
inference(pure_predicate_removal,[],[f3]) ).
fof(f5,plain,
! [X0] :
( ? [X2] :
( ~ big_g(X0)
& big_f(X2) )
& ! [X1] :
( big_g(X1)
| ~ big_f(X0)
| ~ big_f(X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ? [X2] :
( ~ big_g(X0)
& big_f(X2) )
& ! [X1] :
( big_g(X1)
| ~ big_f(X0)
| ~ big_f(X1) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( ~ big_g(X0)
& big_f(X1) )
& ! [X2] :
( big_g(X2)
| ~ big_f(X0)
| ~ big_f(X2) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
( ~ big_g(X0)
& big_f(X1) )
=> ( ~ big_g(X0)
& big_f(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0] :
( ~ big_g(X0)
& big_f(sK0(X0))
& ! [X2] :
( big_g(X2)
| ~ big_f(X0)
| ~ big_f(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
fof(f10,plain,
! [X2,X0] :
( big_g(X2)
| ~ big_f(X0)
| ~ big_f(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X0] : big_f(sK0(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0] : ~ big_g(X0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
~ big_g(X0),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,negated_conjecture,
big_f(sK0(X0)),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
( ~ big_f(X0)
| ~ big_f(X1)
| big_g(X1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_57,plain,
( ~ big_f(X0)
| ~ big_f(X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_49]) ).
cnf(c_71,plain,
( ~ big_f(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_57]) ).
cnf(c_72,plain,
sP0_iProver_split,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_57]) ).
cnf(c_73,plain,
( ~ big_f(sK0(X0))
| ~ sP0_iProver_split ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_74,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_73,c_72,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN318+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 19:24:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.52/1.14 % SZS status Started for theBenchmark.p
% 1.52/1.14 % SZS status Theorem for theBenchmark.p
% 1.52/1.14
% 1.52/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.52/1.14
% 1.52/1.14 ------ iProver source info
% 1.52/1.14
% 1.52/1.14 git: date: 2023-05-31 18:12:56 +0000
% 1.52/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.52/1.14 git: non_committed_changes: false
% 1.52/1.14 git: last_make_outside_of_git: false
% 1.52/1.14
% 1.52/1.14 ------ Parsing...
% 1.52/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.52/1.14
% 1.52/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.52/1.14
% 1.52/1.14 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.52/1.14 ------ Proving...
% 1.52/1.14 ------ Problem Properties
% 1.52/1.14
% 1.52/1.14
% 1.52/1.14 clauses 3
% 1.52/1.14 conjectures 1
% 1.52/1.14 EPR 2
% 1.52/1.14 Horn 3
% 1.52/1.14 unary 2
% 1.52/1.14 binary 1
% 1.52/1.14 lits 4
% 1.52/1.14 lits eq 0
% 1.52/1.14 fd_pure 0
% 1.52/1.14 fd_pseudo 0
% 1.52/1.14 fd_cond 0
% 1.52/1.14 fd_pseudo_cond 0
% 1.52/1.14 AC symbols 0
% 1.52/1.14
% 1.52/1.14 ------ Schedule dynamic 5 is on
% 1.52/1.14
% 1.52/1.14 ------ no equalities: superposition off
% 1.52/1.14
% 1.52/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.14
% 1.52/1.14
% 1.52/1.14 ------
% 1.52/1.14 Current options:
% 1.52/1.14 ------
% 1.52/1.14
% 1.52/1.14
% 1.52/1.14
% 1.52/1.14
% 1.52/1.14 ------ Proving...
% 1.52/1.14
% 1.52/1.14
% 1.52/1.14 % SZS status Theorem for theBenchmark.p
% 1.52/1.14
% 1.52/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.14
% 1.52/1.14
%------------------------------------------------------------------------------