TSTP Solution File: SYN347+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN347+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:30:13 EDT 2024
% Result : Theorem 2.01s 1.16s
% Output : CNFRefutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 2 unt; 0 def)
% Number of atoms : 175 ( 0 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 220 ( 81 ~; 92 |; 36 &)
% ( 7 <=>; 2 =>; 0 <=; 2 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 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 : 75 ( 0 sgn 32 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( big_f(X0,X4)
<=> big_f(X1,X4) )
| ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
<=> big_f(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_17_3) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( big_f(X0,X4)
<=> big_f(X1,X4) )
| ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
<=> big_f(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( big_f(X0,X4)
<~> big_f(X1,X4) )
& ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
<~> big_f(X0,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X4)
| ~ big_f(X0,X4) )
& ( big_f(X1,X4)
| big_f(X0,X4) )
& ( ~ big_f(X0,X1)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(X0,X1)
| ( ( big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X3,X4)
| ~ big_f(X2,X4) ) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X4)
| ~ big_f(X0,X4) )
& ( big_f(X1,X4)
| big_f(X0,X4) )
& ( ~ big_f(X0,X1)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(X0,X1)
| ( ( big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X3,X4)
| ~ big_f(X2,X4) ) ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X4)
| ~ big_f(X0,X4) )
& ( big_f(X1,X4)
| big_f(X0,X4) )
& ( ~ big_f(X0,X1)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(X0,X1)
| ( ( big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X3,X4)
| ~ big_f(X2,X4) ) ) ) )
=> ! [X3,X2] :
? [X4] :
( ( ~ big_f(sK1,X4)
| ~ big_f(sK0,X4) )
& ( big_f(sK1,X4)
| big_f(sK0,X4) )
& ( ~ big_f(sK0,sK1)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(sK0,sK1)
| ( ( big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X3,X4)
| ~ big_f(X2,X4) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ big_f(sK1,X4)
| ~ big_f(sK0,X4) )
& ( big_f(sK1,X4)
| big_f(sK0,X4) )
& ( ~ big_f(sK0,sK1)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(sK0,sK1)
| ( ( big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X3,X4)
| ~ big_f(X2,X4) ) ) ) )
=> ( ( ~ big_f(sK1,sK2(X2,X3))
| ~ big_f(sK0,sK2(X2,X3)) )
& ( big_f(sK1,sK2(X2,X3))
| big_f(sK0,sK2(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(sK0,sK1)
| ( ( big_f(X2,sK2(X2,X3))
| ~ big_f(X3,sK2(X2,X3)) )
& ( big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2,X3] :
( ( ~ big_f(sK1,sK2(X2,X3))
| ~ big_f(sK0,sK2(X2,X3)) )
& ( big_f(sK1,sK2(X2,X3))
| big_f(sK0,sK2(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(sK0,sK1)
| ( ( big_f(X2,sK2(X2,X3))
| ~ big_f(X3,sK2(X2,X3)) )
& ( big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f7,f6]) ).
fof(f9,plain,
! [X2,X3] :
( big_f(sK0,sK1)
| big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X2,X3] :
( big_f(sK0,sK1)
| big_f(X2,sK2(X2,X3))
| ~ big_f(X3,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X2,X3] :
( ~ big_f(sK0,sK1)
| big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X2,X3] :
( ~ big_f(sK0,sK1)
| ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X2,X3] :
( big_f(sK1,sK2(X2,X3))
| big_f(sK0,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X2,X3] :
( ~ big_f(sK1,sK2(X2,X3))
| ~ big_f(sK0,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ big_f(sK1,sK2(X0,X1))
| ~ big_f(sK0,sK2(X0,X1)) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,negated_conjecture,
( big_f(sK1,sK2(X0,X1))
| big_f(sK0,sK2(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_51,negated_conjecture,
( ~ big_f(X0,sK2(X0,X1))
| ~ big_f(X1,sK2(X0,X1))
| ~ big_f(sK0,sK1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_52,negated_conjecture,
( ~ big_f(sK0,sK1)
| big_f(X0,sK2(X0,X1))
| big_f(X1,sK2(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_53,negated_conjecture,
( ~ big_f(X0,sK2(X1,X0))
| big_f(X1,sK2(X1,X0))
| big_f(sK0,sK1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_54,negated_conjecture,
( ~ big_f(X0,sK2(X0,X1))
| big_f(X1,sK2(X0,X1))
| big_f(sK0,sK1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_57,plain,
( ~ big_f(sK0,sK1)
| big_f(sK0,sK2(sK0,sK0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_58,plain,
( ~ big_f(sK0,sK2(sK0,sK0))
| ~ big_f(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_63,negated_conjecture,
~ big_f(sK0,sK1),
inference(global_subsumption_just,[status(thm)],[c_52,c_57,c_58]) ).
cnf(c_112,plain,
( big_f(X1,sK2(X0,X1))
| ~ big_f(X0,sK2(X0,X1)) ),
inference(prop_impl_just,[status(thm)],[c_54,c_57,c_58]) ).
cnf(c_113,plain,
( ~ big_f(X0,sK2(X0,X1))
| big_f(X1,sK2(X0,X1)) ),
inference(renaming,[status(thm)],[c_112]) ).
cnf(c_116,plain,
( ~ big_f(X0,sK2(X1,X0))
| big_f(X1,sK2(X1,X0)) ),
inference(prop_impl_just,[status(thm)],[c_53,c_63]) ).
cnf(c_146,negated_conjecture,
( big_f(sK1,sK2(X0,X1))
| big_f(sK0,sK2(X0,X1)) ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_147,negated_conjecture,
( ~ big_f(sK1,sK2(X0,X1))
| ~ big_f(sK0,sK2(X0,X1)) ),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_148,plain,
( ~ big_f(sK1,sK2(sK1,X0))
| big_f(X0,sK2(sK1,X0)) ),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_149,plain,
( big_f(sK1,sK2(sK1,X0))
| big_f(sK0,sK2(sK1,X0)) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_150,plain,
( ~ big_f(sK1,sK2(sK1,sK0))
| big_f(sK0,sK2(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_151,plain,
( big_f(sK1,sK2(sK1,sK0))
| big_f(sK0,sK2(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_163,plain,
( ~ big_f(sK1,sK2(sK1,sK0))
| ~ big_f(sK0,sK2(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_165,plain,
( ~ big_f(X0,sK2(sK1,X0))
| big_f(sK1,sK2(sK1,X0)) ),
inference(instantiation,[status(thm)],[c_116]) ).
cnf(c_166,plain,
( ~ big_f(sK0,sK2(sK1,sK0))
| big_f(sK1,sK2(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_165]) ).
cnf(c_167,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_166,c_163,c_151,c_150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN347+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 20:39:04 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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
% 2.01/1.16 % SZS status Started for theBenchmark.p
% 2.01/1.16 % SZS status Theorem for theBenchmark.p
% 2.01/1.16
% 2.01/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.01/1.16
% 2.01/1.16 ------ iProver source info
% 2.01/1.16
% 2.01/1.16 git: date: 2024-05-02 19:28:25 +0000
% 2.01/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.01/1.16 git: non_committed_changes: false
% 2.01/1.16
% 2.01/1.16 ------ Parsing...
% 2.01/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.01/1.16
% 2.01/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 2.01/1.16
% 2.01/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.01/1.16 ------ Proving...
% 2.01/1.16 ------ Problem Properties
% 2.01/1.16
% 2.01/1.16
% 2.01/1.16 clauses 4
% 2.01/1.16 conjectures 2
% 2.01/1.16 EPR 0
% 2.01/1.16 Horn 3
% 2.01/1.16 unary 0
% 2.01/1.16 binary 4
% 2.01/1.16 lits 8
% 2.01/1.16 lits eq 0
% 2.01/1.16 fd_pure 0
% 2.01/1.16 fd_pseudo 0
% 2.01/1.16 fd_cond 0
% 2.01/1.16 fd_pseudo_cond 0
% 2.01/1.16 AC symbols 0
% 2.01/1.16
% 2.01/1.16 ------ Schedule dynamic 5 is on
% 2.01/1.16
% 2.01/1.16 ------ no equalities: superposition off
% 2.01/1.16
% 2.01/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.01/1.16
% 2.01/1.16
% 2.01/1.16 ------
% 2.01/1.16 Current options:
% 2.01/1.16 ------
% 2.01/1.16
% 2.01/1.16
% 2.01/1.16
% 2.01/1.16
% 2.01/1.16 ------ Proving...
% 2.01/1.16
% 2.01/1.16
% 2.01/1.16 % SZS status Theorem for theBenchmark.p
% 2.01/1.16
% 2.01/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.01/1.16
% 2.01/1.16
%------------------------------------------------------------------------------