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