TSTP Solution File: SYN386+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN386+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:49 EDT 2023
% Result : Theorem 1.50s 1.19s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 148 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 172 ( 62 ~; 46 |; 39 &)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 195 ( 4 sgn; 111 !; 54 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X2] :
? [X5] :
! [X6,X7] :
( big_d(X6,X7,X5)
=> ! [X1,X8] :
( ( big_f(X7,X8)
& big_f(X6,X1) )
=> big_d(X1,X8,X2) ) )
& ? [X0] :
! [X2] :
? [X3] :
! [X4] :
( big_s(X3,X4)
=> big_d(X4,X0,X2) )
& ! [X0] :
? [X1] : big_f(X0,X1) )
=> ? [X1] :
! [X2] :
? [X9] :
! [X4] :
( big_s(X9,X4)
=> ! [X8] :
( big_f(X4,X8)
=> big_d(X8,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2138) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
? [X5] :
! [X6,X7] :
( big_d(X6,X7,X5)
=> ! [X1,X8] :
( ( big_f(X7,X8)
& big_f(X6,X1) )
=> big_d(X1,X8,X2) ) )
& ? [X0] :
! [X2] :
? [X3] :
! [X4] :
( big_s(X3,X4)
=> big_d(X4,X0,X2) )
& ! [X0] :
? [X1] : big_f(X0,X1) )
=> ? [X1] :
! [X2] :
? [X9] :
! [X4] :
( big_s(X9,X4)
=> ! [X8] :
( big_f(X4,X8)
=> big_d(X8,X1,X2) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0] :
? [X1] :
! [X2,X3] :
( big_d(X2,X3,X1)
=> ! [X4,X5] :
( ( big_f(X3,X5)
& big_f(X2,X4) )
=> big_d(X4,X5,X0) ) )
& ? [X6] :
! [X7] :
? [X8] :
! [X9] :
( big_s(X8,X9)
=> big_d(X9,X6,X7) )
& ! [X10] :
? [X11] : big_f(X10,X11) )
=> ? [X12] :
! [X13] :
? [X14] :
! [X15] :
( big_s(X14,X15)
=> ! [X16] :
( big_f(X15,X16)
=> big_d(X16,X12,X13) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X12] :
? [X13] :
! [X14] :
? [X15] :
( ? [X16] :
( ~ big_d(X16,X12,X13)
& big_f(X15,X16) )
& big_s(X14,X15) )
& ! [X0] :
? [X1] :
! [X2,X3] :
( ! [X4,X5] :
( big_d(X4,X5,X0)
| ~ big_f(X3,X5)
| ~ big_f(X2,X4) )
| ~ big_d(X2,X3,X1) )
& ? [X6] :
! [X7] :
? [X8] :
! [X9] :
( big_d(X9,X6,X7)
| ~ big_s(X8,X9) )
& ! [X10] :
? [X11] : big_f(X10,X11) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X12] :
? [X13] :
! [X14] :
? [X15] :
( ? [X16] :
( ~ big_d(X16,X12,X13)
& big_f(X15,X16) )
& big_s(X14,X15) )
& ! [X0] :
? [X1] :
! [X2,X3] :
( ! [X4,X5] :
( big_d(X4,X5,X0)
| ~ big_f(X3,X5)
| ~ big_f(X2,X4) )
| ~ big_d(X2,X3,X1) )
& ? [X6] :
! [X7] :
? [X8] :
! [X9] :
( big_d(X9,X6,X7)
| ~ big_s(X8,X9) )
& ! [X10] :
? [X11] : big_f(X10,X11) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ? [X4] :
( ~ big_d(X4,X0,X1)
& big_f(X3,X4) )
& big_s(X2,X3) )
& ! [X5] :
? [X6] :
! [X7,X8] :
( ! [X9,X10] :
( big_d(X9,X10,X5)
| ~ big_f(X8,X10)
| ~ big_f(X7,X9) )
| ~ big_d(X7,X8,X6) )
& ? [X11] :
! [X12] :
? [X13] :
! [X14] :
( big_d(X14,X11,X12)
| ~ big_s(X13,X14) )
& ! [X15] :
? [X16] : big_f(X15,X16) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
! [X2] :
? [X3] :
( ? [X4] :
( ~ big_d(X4,X0,X1)
& big_f(X3,X4) )
& big_s(X2,X3) )
=> ! [X2] :
? [X3] :
( ? [X4] :
( ~ big_d(X4,X0,sK0(X0))
& big_f(X3,X4) )
& big_s(X2,X3) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X2] :
( ? [X3] :
( ? [X4] :
( ~ big_d(X4,X0,sK0(X0))
& big_f(X3,X4) )
& big_s(X2,X3) )
=> ( ? [X4] :
( ~ big_d(X4,X0,sK0(X0))
& big_f(sK1(X0,X2),X4) )
& big_s(X2,sK1(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0,X2] :
( ? [X4] :
( ~ big_d(X4,X0,sK0(X0))
& big_f(sK1(X0,X2),X4) )
=> ( ~ big_d(sK2(X0,X2),X0,sK0(X0))
& big_f(sK1(X0,X2),sK2(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X5] :
( ? [X6] :
! [X7,X8] :
( ! [X9,X10] :
( big_d(X9,X10,X5)
| ~ big_f(X8,X10)
| ~ big_f(X7,X9) )
| ~ big_d(X7,X8,X6) )
=> ! [X8,X7] :
( ! [X9,X10] :
( big_d(X9,X10,X5)
| ~ big_f(X8,X10)
| ~ big_f(X7,X9) )
| ~ big_d(X7,X8,sK3(X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X11] :
! [X12] :
? [X13] :
! [X14] :
( big_d(X14,X11,X12)
| ~ big_s(X13,X14) )
=> ! [X12] :
? [X13] :
! [X14] :
( big_d(X14,sK4,X12)
| ~ big_s(X13,X14) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X12] :
( ? [X13] :
! [X14] :
( big_d(X14,sK4,X12)
| ~ big_s(X13,X14) )
=> ! [X14] :
( big_d(X14,sK4,X12)
| ~ big_s(sK5(X12),X14) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X15] :
( ? [X16] : big_f(X15,X16)
=> big_f(X15,sK6(X15)) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ! [X0,X2] :
( ~ big_d(sK2(X0,X2),X0,sK0(X0))
& big_f(sK1(X0,X2),sK2(X0,X2))
& big_s(X2,sK1(X0,X2)) )
& ! [X5,X7,X8] :
( ! [X9,X10] :
( big_d(X9,X10,X5)
| ~ big_f(X8,X10)
| ~ big_f(X7,X9) )
| ~ big_d(X7,X8,sK3(X5)) )
& ! [X12,X14] :
( big_d(X14,sK4,X12)
| ~ big_s(sK5(X12),X14) )
& ! [X15] : big_f(X15,sK6(X15)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f6,f13,f12,f11,f10,f9,f8,f7]) ).
fof(f15,plain,
! [X15] : big_f(X15,sK6(X15)),
inference(cnf_transformation,[],[f14]) ).
fof(f16,plain,
! [X14,X12] :
( big_d(X14,sK4,X12)
| ~ big_s(sK5(X12),X14) ),
inference(cnf_transformation,[],[f14]) ).
fof(f17,plain,
! [X10,X8,X9,X7,X5] :
( big_d(X9,X10,X5)
| ~ big_f(X8,X10)
| ~ big_f(X7,X9)
| ~ big_d(X7,X8,sK3(X5)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f18,plain,
! [X2,X0] : big_s(X2,sK1(X0,X2)),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X2,X0] : big_f(sK1(X0,X2),sK2(X0,X2)),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X2,X0] : ~ big_d(sK2(X0,X2),X0,sK0(X0)),
inference(cnf_transformation,[],[f14]) ).
cnf(c_49,negated_conjecture,
~ big_d(sK2(X0,X1),X0,sK0(X0)),
inference(cnf_transformation,[],[f20]) ).
cnf(c_50,negated_conjecture,
big_f(sK1(X0,X1),sK2(X0,X1)),
inference(cnf_transformation,[],[f19]) ).
cnf(c_51,negated_conjecture,
big_s(X0,sK1(X1,X0)),
inference(cnf_transformation,[],[f18]) ).
cnf(c_52,negated_conjecture,
( ~ big_d(X0,X1,sK3(X2))
| ~ big_f(X0,X4)
| ~ big_f(X1,X3)
| big_d(X4,X3,X2) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,negated_conjecture,
( ~ big_s(sK5(X0),X1)
| big_d(X1,sK4,X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,negated_conjecture,
big_f(X0,sK6(X0)),
inference(cnf_transformation,[],[f15]) ).
cnf(c_55,plain,
big_f(sK4,sK6(sK4)),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_81,plain,
big_d(sK1(X0,sK5(X1)),sK4,X1),
inference(resolution,[status(thm)],[c_51,c_53]) ).
cnf(c_103,plain,
( ~ big_d(sK1(X0,X1),X2,sK3(X3))
| ~ big_f(sK1(X0,X1),sK2(X0,X1))
| ~ big_f(X2,X4)
| big_d(sK2(X0,X1),X4,X3) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_107,plain,
( ~ big_d(sK1(X0,X1),X2,sK3(sK0(X0)))
| ~ big_f(sK1(X0,X1),sK2(X0,X1))
| ~ big_f(X2,X0)
| big_d(sK2(X0,X1),X0,sK0(X0)) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_111,plain,
( ~ big_d(sK1(sK6(X0),X1),X0,sK3(sK0(sK6(X0))))
| ~ big_f(sK1(sK6(X0),X1),sK2(sK6(X0),X1))
| ~ big_f(X0,sK6(X0))
| big_d(sK2(sK6(X0),X1),sK6(X0),sK0(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_107]) ).
cnf(c_113,plain,
~ big_d(sK2(sK6(X0),X1),sK6(X0),sK0(sK6(X0))),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_131,plain,
( ~ big_f(sK1(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))),sK2(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))))
| ~ big_d(sK1(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))),sK4,sK3(sK0(sK6(sK4))))
| ~ big_f(sK4,sK6(sK4))
| big_d(sK2(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))),sK6(sK4),sK0(sK6(sK4))) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_132,plain,
big_d(sK1(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))),sK4,sK3(sK0(sK6(sK4)))),
inference(instantiation,[status(thm)],[c_81]) ).
cnf(c_138,plain,
~ big_d(sK2(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))),sK6(sK4),sK0(sK6(sK4))),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_145,plain,
big_f(sK1(X0,sK5(sK3(X1))),sK2(X0,sK5(sK3(X1)))),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_177,plain,
big_f(sK1(sK6(sK4),sK5(sK3(sK0(sK6(sK4))))),sK2(sK6(sK4),sK5(sK3(sK0(sK6(sK4)))))),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_178,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_177,c_138,c_132,c_131,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SYN386+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.15 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 17:14:12 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.50/1.19 % SZS status Started for theBenchmark.p
% 1.50/1.19 % SZS status Theorem for theBenchmark.p
% 1.50/1.19
% 1.50/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.50/1.19
% 1.50/1.19 ------ iProver source info
% 1.50/1.19
% 1.50/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.50/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.50/1.19 git: non_committed_changes: false
% 1.50/1.19 git: last_make_outside_of_git: false
% 1.50/1.19
% 1.50/1.19 ------ Parsing...
% 1.50/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.50/1.19
% 1.50/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.50/1.19
% 1.50/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.50/1.19 ------ Proving...
% 1.50/1.19 ------ Problem Properties
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 clauses 5
% 1.50/1.19 conjectures 4
% 1.50/1.19 EPR 0
% 1.50/1.19 Horn 5
% 1.50/1.19 unary 4
% 1.50/1.19 binary 0
% 1.50/1.19 lits 8
% 1.50/1.19 lits eq 0
% 1.50/1.19 fd_pure 0
% 1.50/1.19 fd_pseudo 0
% 1.50/1.19 fd_cond 0
% 1.50/1.19 fd_pseudo_cond 0
% 1.50/1.19 AC symbols 0
% 1.50/1.19
% 1.50/1.19 ------ Schedule dynamic 5 is on
% 1.50/1.19
% 1.50/1.19 ------ no equalities: superposition off
% 1.50/1.19
% 1.50/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 ------
% 1.50/1.19 Current options:
% 1.50/1.19 ------
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 ------ Proving...
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 % SZS status Theorem for theBenchmark.p
% 1.50/1.19
% 1.50/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.50/1.19
% 1.50/1.19
%------------------------------------------------------------------------------