TSTP Solution File: PUZ047+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ047+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : Thu Aug 31 13:19:44 EDT 2023
% Result : Theorem 1.53s 1.18s
% Output : CNFRefutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 216 ( 0 equ)
% Maximal formula atoms : 30 ( 7 avg)
% Number of connectives : 254 ( 68 ~; 54 |; 87 &)
% ( 0 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 143 ( 8 sgn; 122 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X17] :
( p(north,south,north,north,X17)
=> p(south,south,north,south,take_cabbage(X17)) )
& ! [X16] :
( p(south,south,north,south,X16)
=> p(north,south,north,north,take_cabbage(X16)) )
& ! [X15] :
( p(north,north,south,north,X15)
=> p(south,north,south,south,take_cabbage(X15)) )
& ! [X14] :
( p(south,north,south,south,X14)
=> p(north,north,south,north,take_cabbage(X14)) )
& ! [X11,X12,X13] :
( p(north,X11,north,X12,X13)
=> p(south,X11,south,X12,take_goat(X13)) )
& ! [X8,X9,X10] :
( p(south,X8,south,X9,X10)
=> p(north,X8,north,X9,take_goat(X10)) )
& ! [X7] :
( p(north,north,north,south,X7)
=> p(south,south,north,south,take_wolf(X7)) )
& ! [X6] :
( p(south,south,north,south,X6)
=> p(north,north,north,south,take_wolf(X6)) )
& ! [X5] :
( p(north,north,south,north,X5)
=> p(south,south,south,north,take_wolf(X5)) )
& ! [X4] :
( p(south,south,south,north,X4)
=> p(north,north,south,north,take_wolf(X4)) )
& ! [X3] :
( p(north,south,north,south,X3)
=> p(south,south,north,south,go_alone(X3)) )
& ! [X2] :
( p(south,south,north,south,X2)
=> p(north,south,north,south,go_alone(X2)) )
& ! [X1] :
( p(north,north,south,north,X1)
=> p(south,north,south,north,go_alone(X1)) )
& ! [X0] :
( p(south,north,south,north,X0)
=> p(north,north,south,north,go_alone(X0)) )
& p(south,south,south,south,start) )
=> ? [X18] : p(north,north,north,north,X18) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100) ).
fof(f2,negated_conjecture,
~ ( ( ! [X17] :
( p(north,south,north,north,X17)
=> p(south,south,north,south,take_cabbage(X17)) )
& ! [X16] :
( p(south,south,north,south,X16)
=> p(north,south,north,north,take_cabbage(X16)) )
& ! [X15] :
( p(north,north,south,north,X15)
=> p(south,north,south,south,take_cabbage(X15)) )
& ! [X14] :
( p(south,north,south,south,X14)
=> p(north,north,south,north,take_cabbage(X14)) )
& ! [X11,X12,X13] :
( p(north,X11,north,X12,X13)
=> p(south,X11,south,X12,take_goat(X13)) )
& ! [X8,X9,X10] :
( p(south,X8,south,X9,X10)
=> p(north,X8,north,X9,take_goat(X10)) )
& ! [X7] :
( p(north,north,north,south,X7)
=> p(south,south,north,south,take_wolf(X7)) )
& ! [X6] :
( p(south,south,north,south,X6)
=> p(north,north,north,south,take_wolf(X6)) )
& ! [X5] :
( p(north,north,south,north,X5)
=> p(south,south,south,north,take_wolf(X5)) )
& ! [X4] :
( p(south,south,south,north,X4)
=> p(north,north,south,north,take_wolf(X4)) )
& ! [X3] :
( p(north,south,north,south,X3)
=> p(south,south,north,south,go_alone(X3)) )
& ! [X2] :
( p(south,south,north,south,X2)
=> p(north,south,north,south,go_alone(X2)) )
& ! [X1] :
( p(north,north,south,north,X1)
=> p(south,north,south,north,go_alone(X1)) )
& ! [X0] :
( p(south,north,south,north,X0)
=> p(north,north,south,north,go_alone(X0)) )
& p(south,south,south,south,start) )
=> ? [X18] : p(north,north,north,north,X18) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( p(north,south,north,north,X0)
=> p(south,south,north,south,take_cabbage(X0)) )
& ! [X1] :
( p(south,south,north,south,X1)
=> p(north,south,north,north,take_cabbage(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,south,take_cabbage(X2)) )
& ! [X3] :
( p(south,north,south,south,X3)
=> p(north,north,south,north,take_cabbage(X3)) )
& ! [X4,X5,X6] :
( p(north,X4,north,X5,X6)
=> p(south,X4,south,X5,take_goat(X6)) )
& ! [X7,X8,X9] :
( p(south,X7,south,X8,X9)
=> p(north,X7,north,X8,take_goat(X9)) )
& ! [X10] :
( p(north,north,north,south,X10)
=> p(south,south,north,south,take_wolf(X10)) )
& ! [X11] :
( p(south,south,north,south,X11)
=> p(north,north,north,south,take_wolf(X11)) )
& ! [X12] :
( p(north,north,south,north,X12)
=> p(south,south,south,north,take_wolf(X12)) )
& ! [X13] :
( p(south,south,south,north,X13)
=> p(north,north,south,north,take_wolf(X13)) )
& ! [X14] :
( p(north,south,north,south,X14)
=> p(south,south,north,south,go_alone(X14)) )
& ! [X15] :
( p(south,south,north,south,X15)
=> p(north,south,north,south,go_alone(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,north,go_alone(X16)) )
& ! [X17] :
( p(south,north,south,north,X17)
=> p(north,north,south,north,go_alone(X17)) )
& p(south,south,south,south,start) )
=> ? [X18] : p(north,north,north,north,X18) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X18] : ~ p(north,north,north,north,X18)
& ! [X0] :
( p(south,south,north,south,take_cabbage(X0))
| ~ p(north,south,north,north,X0) )
& ! [X1] :
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) )
& ! [X2] :
( p(south,north,south,south,take_cabbage(X2))
| ~ p(north,north,south,north,X2) )
& ! [X3] :
( p(north,north,south,north,take_cabbage(X3))
| ~ p(south,north,south,south,X3) )
& ! [X4,X5,X6] :
( p(south,X4,south,X5,take_goat(X6))
| ~ p(north,X4,north,X5,X6) )
& ! [X7,X8,X9] :
( p(north,X7,north,X8,take_goat(X9))
| ~ p(south,X7,south,X8,X9) )
& ! [X10] :
( p(south,south,north,south,take_wolf(X10))
| ~ p(north,north,north,south,X10) )
& ! [X11] :
( p(north,north,north,south,take_wolf(X11))
| ~ p(south,south,north,south,X11) )
& ! [X12] :
( p(south,south,south,north,take_wolf(X12))
| ~ p(north,north,south,north,X12) )
& ! [X13] :
( p(north,north,south,north,take_wolf(X13))
| ~ p(south,south,south,north,X13) )
& ! [X14] :
( p(south,south,north,south,go_alone(X14))
| ~ p(north,south,north,south,X14) )
& ! [X15] :
( p(north,south,north,south,go_alone(X15))
| ~ p(south,south,north,south,X15) )
& ! [X16] :
( p(south,north,south,north,go_alone(X16))
| ~ p(north,north,south,north,X16) )
& ! [X17] :
( p(north,north,south,north,go_alone(X17))
| ~ p(south,north,south,north,X17) )
& p(south,south,south,south,start) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X18] : ~ p(north,north,north,north,X18)
& ! [X0] :
( p(south,south,north,south,take_cabbage(X0))
| ~ p(north,south,north,north,X0) )
& ! [X1] :
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) )
& ! [X2] :
( p(south,north,south,south,take_cabbage(X2))
| ~ p(north,north,south,north,X2) )
& ! [X3] :
( p(north,north,south,north,take_cabbage(X3))
| ~ p(south,north,south,south,X3) )
& ! [X4,X5,X6] :
( p(south,X4,south,X5,take_goat(X6))
| ~ p(north,X4,north,X5,X6) )
& ! [X7,X8,X9] :
( p(north,X7,north,X8,take_goat(X9))
| ~ p(south,X7,south,X8,X9) )
& ! [X10] :
( p(south,south,north,south,take_wolf(X10))
| ~ p(north,north,north,south,X10) )
& ! [X11] :
( p(north,north,north,south,take_wolf(X11))
| ~ p(south,south,north,south,X11) )
& ! [X12] :
( p(south,south,south,north,take_wolf(X12))
| ~ p(north,north,south,north,X12) )
& ! [X13] :
( p(north,north,south,north,take_wolf(X13))
| ~ p(south,south,south,north,X13) )
& ! [X14] :
( p(south,south,north,south,go_alone(X14))
| ~ p(north,south,north,south,X14) )
& ! [X15] :
( p(north,south,north,south,go_alone(X15))
| ~ p(south,south,north,south,X15) )
& ! [X16] :
( p(south,north,south,north,go_alone(X16))
| ~ p(north,north,south,north,X16) )
& ! [X17] :
( p(north,north,south,north,go_alone(X17))
| ~ p(south,north,south,north,X17) )
& p(south,south,south,south,start) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0] : ~ p(north,north,north,north,X0)
& ! [X1] :
( p(south,south,north,south,take_cabbage(X1))
| ~ p(north,south,north,north,X1) )
& ! [X2] :
( p(north,south,north,north,take_cabbage(X2))
| ~ p(south,south,north,south,X2) )
& ! [X3] :
( p(south,north,south,south,take_cabbage(X3))
| ~ p(north,north,south,north,X3) )
& ! [X4] :
( p(north,north,south,north,take_cabbage(X4))
| ~ p(south,north,south,south,X4) )
& ! [X5,X6,X7] :
( p(south,X5,south,X6,take_goat(X7))
| ~ p(north,X5,north,X6,X7) )
& ! [X8,X9,X10] :
( p(north,X8,north,X9,take_goat(X10))
| ~ p(south,X8,south,X9,X10) )
& ! [X11] :
( p(south,south,north,south,take_wolf(X11))
| ~ p(north,north,north,south,X11) )
& ! [X12] :
( p(north,north,north,south,take_wolf(X12))
| ~ p(south,south,north,south,X12) )
& ! [X13] :
( p(south,south,south,north,take_wolf(X13))
| ~ p(north,north,south,north,X13) )
& ! [X14] :
( p(north,north,south,north,take_wolf(X14))
| ~ p(south,south,south,north,X14) )
& ! [X15] :
( p(south,south,north,south,go_alone(X15))
| ~ p(north,south,north,south,X15) )
& ! [X16] :
( p(north,south,north,south,go_alone(X16))
| ~ p(south,south,north,south,X16) )
& ! [X17] :
( p(south,north,south,north,go_alone(X17))
| ~ p(north,north,south,north,X17) )
& ! [X18] :
( p(north,north,south,north,go_alone(X18))
| ~ p(south,north,south,north,X18) )
& p(south,south,south,south,start) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
p(south,south,south,south,start),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X17] :
( p(south,north,south,north,go_alone(X17))
| ~ p(north,north,south,north,X17) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X15] :
( p(south,south,north,south,go_alone(X15))
| ~ p(north,south,north,south,X15) ),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
! [X14] :
( p(north,north,south,north,take_wolf(X14))
| ~ p(south,south,south,north,X14) ),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
! [X10,X8,X9] :
( p(north,X8,north,X9,take_goat(X10))
| ~ p(south,X8,south,X9,X10) ),
inference(cnf_transformation,[],[f6]) ).
fof(f17,plain,
! [X6,X7,X5] :
( p(south,X5,south,X6,take_goat(X7))
| ~ p(north,X5,north,X6,X7) ),
inference(cnf_transformation,[],[f6]) ).
fof(f20,plain,
! [X2] :
( p(north,south,north,north,take_cabbage(X2))
| ~ p(south,south,north,south,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f22,plain,
! [X0] : ~ p(north,north,north,north,X0),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
~ p(north,north,north,north,X0),
inference(cnf_transformation,[],[f22]) ).
cnf(c_51,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,negated_conjecture,
( ~ p(north,X0,north,X1,X2)
| p(south,X0,south,X1,take_goat(X2)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_55,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_59,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_60,negated_conjecture,
( ~ p(north,south,north,south,X0)
| p(south,south,north,south,go_alone(X0)) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_62,negated_conjecture,
( ~ p(north,north,south,north,X0)
| p(south,north,south,north,go_alone(X0)) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_64,negated_conjecture,
p(south,south,south,south,start),
inference(cnf_transformation,[],[f7]) ).
cnf(c_245,plain,
~ p(south,north,south,north,X0),
inference(superposition,[status(thm)],[c_55,c_49]) ).
cnf(c_302,plain,
~ p(north,north,south,north,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_62,c_245]) ).
cnf(c_303,plain,
~ p(south,south,south,north,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_59,c_302]) ).
cnf(c_310,plain,
~ p(north,south,north,north,X0),
inference(superposition,[status(thm)],[c_54,c_303]) ).
cnf(c_311,plain,
~ p(south,south,north,south,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_310]) ).
cnf(c_312,plain,
~ p(north,south,north,south,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_311]) ).
cnf(c_326,plain,
~ p(south,south,south,south,X0),
inference(superposition,[status(thm)],[c_55,c_312]) ).
cnf(c_327,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_64,c_326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ047+1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 22:30:25 EDT 2023
% 0.13/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
% 1.53/1.18 % SZS status Started for theBenchmark.p
% 1.53/1.18 % SZS status Theorem for theBenchmark.p
% 1.53/1.18
% 1.53/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.53/1.18
% 1.53/1.18 ------ iProver source info
% 1.53/1.18
% 1.53/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.53/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.53/1.18 git: non_committed_changes: false
% 1.53/1.18 git: last_make_outside_of_git: false
% 1.53/1.18
% 1.53/1.18 ------ Parsing...
% 1.53/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.53/1.18
% 1.53/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.53/1.18
% 1.53/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.53/1.18 ------ Proving...
% 1.53/1.18 ------ Problem Properties
% 1.53/1.18
% 1.53/1.18
% 1.53/1.18 clauses 16
% 1.53/1.18 conjectures 16
% 1.53/1.18 EPR 2
% 1.53/1.18 Horn 16
% 1.53/1.18 unary 2
% 1.53/1.18 binary 14
% 1.53/1.18 lits 30
% 1.53/1.18 lits eq 0
% 1.53/1.18 fd_pure 0
% 1.53/1.18 fd_pseudo 0
% 1.53/1.18 fd_cond 0
% 1.53/1.18 fd_pseudo_cond 0
% 1.53/1.18 AC symbols 0
% 1.53/1.18
% 1.53/1.18 ------ Schedule dynamic 5 is on
% 1.53/1.18
% 1.53/1.18 ------ no equalities: superposition off
% 1.53/1.18
% 1.53/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.53/1.18
% 1.53/1.18
% 1.53/1.18 ------
% 1.53/1.18 Current options:
% 1.53/1.18 ------
% 1.53/1.18
% 1.53/1.18
% 1.53/1.18
% 1.53/1.18
% 1.53/1.18 ------ Proving...
% 1.53/1.18
% 1.53/1.18
% 1.53/1.18 % SZS status Theorem for theBenchmark.p
% 1.53/1.18
% 1.53/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.55/1.18
% 1.55/1.18
%------------------------------------------------------------------------------