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