TSTP Solution File: SYN346+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN346+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:34 EDT 2023
% Result : Theorem 0.70s 1.16s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 98 ( 39 ~; 21 |; 30 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 55 ( 4 sgn; 29 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4,X5] :
( big_f(X1,X4)
=> ( big_f(X2,X5)
=> ( ( big_f(X3,X5)
& big_f(X1,X5) )
| ( big_f(X3,X4)
& big_f(X2,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_2) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4,X5] :
( big_f(X1,X4)
=> ( big_f(X2,X5)
=> ( ( big_f(X3,X5)
& big_f(X1,X5) )
| ( big_f(X3,X4)
& big_f(X2,X4) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ! [X1] :
? [X2,X3] :
! [X4,X5] :
( big_f(X1,X4)
=> ( big_f(X2,X5)
=> ( ( big_f(X3,X5)
& big_f(X1,X5) )
| ( big_f(X3,X4)
& big_f(X2,X4) ) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X1] :
! [X2,X3] :
? [X4,X5] :
( ( ~ big_f(X3,X5)
| ~ big_f(X1,X5) )
& ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& big_f(X2,X5)
& big_f(X1,X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X1] :
! [X2,X3] :
? [X4,X5] :
( ( ~ big_f(X3,X5)
| ~ big_f(X1,X5) )
& ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& big_f(X2,X5)
& big_f(X1,X4) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0] :
! [X1,X2] :
? [X3,X4] :
( ( ~ big_f(X2,X4)
| ~ big_f(X0,X4) )
& ( ~ big_f(X2,X3)
| ~ big_f(X1,X3) )
& big_f(X1,X4)
& big_f(X0,X3) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
! [X1,X2] :
? [X3,X4] :
( ( ~ big_f(X2,X4)
| ~ big_f(X0,X4) )
& ( ~ big_f(X2,X3)
| ~ big_f(X1,X3) )
& big_f(X1,X4)
& big_f(X0,X3) )
=> ! [X2,X1] :
? [X4,X3] :
( ( ~ big_f(X2,X4)
| ~ big_f(sK0,X4) )
& ( ~ big_f(X2,X3)
| ~ big_f(X1,X3) )
& big_f(X1,X4)
& big_f(sK0,X3) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X1,X2] :
( ? [X4,X3] :
( ( ~ big_f(X2,X4)
| ~ big_f(sK0,X4) )
& ( ~ big_f(X2,X3)
| ~ big_f(X1,X3) )
& big_f(X1,X4)
& big_f(sK0,X3) )
=> ( ( ~ big_f(X2,sK2(X1,X2))
| ~ big_f(sK0,sK2(X1,X2)) )
& ( ~ big_f(X2,sK1(X1,X2))
| ~ big_f(X1,sK1(X1,X2)) )
& big_f(X1,sK2(X1,X2))
& big_f(sK0,sK1(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X1,X2] :
( ( ~ big_f(X2,sK2(X1,X2))
| ~ big_f(sK0,sK2(X1,X2)) )
& ( ~ big_f(X2,sK1(X1,X2))
| ~ big_f(X1,sK1(X1,X2)) )
& big_f(X1,sK2(X1,X2))
& big_f(sK0,sK1(X1,X2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f10,plain,
! [X2,X1] : big_f(sK0,sK1(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2,X1] :
( ~ big_f(X2,sK1(X1,X2))
| ~ big_f(X1,sK1(X1,X2)) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_50,negated_conjecture,
( ~ big_f(X0,sK1(X1,X0))
| ~ big_f(X1,sK1(X1,X0)) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_52,negated_conjecture,
big_f(sK0,sK1(X0,X1)),
inference(cnf_transformation,[],[f10]) ).
cnf(c_53,plain,
big_f(sK0,sK1(sK0,sK0)),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_55,plain,
~ big_f(sK0,sK1(sK0,sK0)),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_56,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_55,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN346+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.17/0.35 % Computer : n019.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Sat Aug 26 20:06:58 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.70/1.16 % SZS status Started for theBenchmark.p
% 0.70/1.16 % SZS status Theorem for theBenchmark.p
% 0.70/1.16
% 0.70/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.70/1.16
% 0.70/1.16 ------ iProver source info
% 0.70/1.16
% 0.70/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.70/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.70/1.16 git: non_committed_changes: false
% 0.70/1.16 git: last_make_outside_of_git: false
% 0.70/1.16
% 0.70/1.16 ------ Parsing...
% 0.70/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.70/1.16
% 0.70/1.16 ------ Preprocessing...
% 0.70/1.16
% 0.70/1.16 % SZS status Theorem for theBenchmark.p
% 0.70/1.16
% 0.70/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.70/1.16
% 0.70/1.16
%------------------------------------------------------------------------------