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