TSTP Solution File: PUZ047+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Mon Jul 18 18:10:44 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 182 ( 0 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 210 ( 58 ~; 49 |; 57 &)
% ( 1 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-5 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 103 ( 7 sgn 73 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm100,conjecture,
( ( p(south,south,south,south,start)
& ! [X1] :
( p(south,north,south,north,X1)
=> p(north,north,south,north,go_alone(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,north,go_alone(X2)) )
& ! [X3] :
( p(south,south,north,south,X3)
=> p(north,south,north,south,go_alone(X3)) )
& ! [X4] :
( p(north,south,north,south,X4)
=> p(south,south,north,south,go_alone(X4)) )
& ! [X5] :
( p(south,south,south,north,X5)
=> p(north,north,south,north,take_wolf(X5)) )
& ! [X6] :
( p(north,north,south,north,X6)
=> p(south,south,south,north,take_wolf(X6)) )
& ! [X7] :
( p(south,south,north,south,X7)
=> p(north,north,north,south,take_wolf(X7)) )
& ! [X8] :
( p(north,north,north,south,X8)
=> p(south,south,north,south,take_wolf(X8)) )
& ! [X9,X10,X11] :
( p(south,X9,south,X10,X11)
=> p(north,X9,north,X10,take_goat(X11)) )
& ! [X12,X13,X14] :
( p(north,X12,north,X13,X14)
=> p(south,X12,south,X13,take_goat(X14)) )
& ! [X15] :
( p(south,north,south,south,X15)
=> p(north,north,south,north,take_cabbage(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,south,take_cabbage(X16)) )
& ! [X17] :
( p(south,south,north,south,X17)
=> p(north,south,north,north,take_cabbage(X17)) )
& ! [X18] :
( p(north,south,north,north,X18)
=> p(south,south,north,south,take_cabbage(X18)) ) )
=> ? [X19] : p(north,north,north,north,X19) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm100) ).
fof(c_0_1,plain,
( epred1_0
<=> ( p(south,south,south,south,start)
& ! [X1] :
( p(south,north,south,north,X1)
=> p(north,north,south,north,go_alone(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,north,go_alone(X2)) )
& ! [X3] :
( p(south,south,north,south,X3)
=> p(north,south,north,south,go_alone(X3)) )
& ! [X4] :
( p(north,south,north,south,X4)
=> p(south,south,north,south,go_alone(X4)) )
& ! [X5] :
( p(south,south,south,north,X5)
=> p(north,north,south,north,take_wolf(X5)) )
& ! [X6] :
( p(north,north,south,north,X6)
=> p(south,south,south,north,take_wolf(X6)) )
& ! [X7] :
( p(south,south,north,south,X7)
=> p(north,north,north,south,take_wolf(X7)) )
& ! [X8] :
( p(north,north,north,south,X8)
=> p(south,south,north,south,take_wolf(X8)) )
& ! [X9,X10,X11] :
( p(south,X9,south,X10,X11)
=> p(north,X9,north,X10,take_goat(X11)) )
& ! [X12,X13,X14] :
( p(north,X12,north,X13,X14)
=> p(south,X12,south,X13,take_goat(X14)) )
& ! [X15] :
( p(south,north,south,south,X15)
=> p(north,north,south,north,take_cabbage(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,south,take_cabbage(X16)) )
& ! [X17] :
( p(south,south,north,south,X17)
=> p(north,south,north,north,take_cabbage(X17)) )
& ! [X18] :
( p(north,south,north,north,X18)
=> p(south,south,north,south,take_cabbage(X18)) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( p(south,south,south,south,start)
& ! [X1] :
( p(south,north,south,north,X1)
=> p(north,north,south,north,go_alone(X1)) )
& ! [X2] :
( p(north,north,south,north,X2)
=> p(south,north,south,north,go_alone(X2)) )
& ! [X3] :
( p(south,south,north,south,X3)
=> p(north,south,north,south,go_alone(X3)) )
& ! [X4] :
( p(north,south,north,south,X4)
=> p(south,south,north,south,go_alone(X4)) )
& ! [X5] :
( p(south,south,south,north,X5)
=> p(north,north,south,north,take_wolf(X5)) )
& ! [X6] :
( p(north,north,south,north,X6)
=> p(south,south,south,north,take_wolf(X6)) )
& ! [X7] :
( p(south,south,north,south,X7)
=> p(north,north,north,south,take_wolf(X7)) )
& ! [X8] :
( p(north,north,north,south,X8)
=> p(south,south,north,south,take_wolf(X8)) )
& ! [X9,X10,X11] :
( p(south,X9,south,X10,X11)
=> p(north,X9,north,X10,take_goat(X11)) )
& ! [X12,X13,X14] :
( p(north,X12,north,X13,X14)
=> p(south,X12,south,X13,take_goat(X14)) )
& ! [X15] :
( p(south,north,south,south,X15)
=> p(north,north,south,north,take_cabbage(X15)) )
& ! [X16] :
( p(north,north,south,north,X16)
=> p(south,north,south,south,take_cabbage(X16)) )
& ! [X17] :
( p(south,south,north,south,X17)
=> p(north,south,north,north,take_cabbage(X17)) )
& ! [X18] :
( p(north,south,north,north,X18)
=> p(south,south,north,south,take_cabbage(X18)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ? [X19] : p(north,north,north,north,X19) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm100]),c_0_1]) ).
fof(c_0_4,plain,
! [X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36] :
( ( p(south,south,south,south,start)
| ~ epred1_0 )
& ( ~ p(south,north,south,north,X19)
| p(north,north,south,north,go_alone(X19))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X20)
| p(south,north,south,north,go_alone(X20))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X21)
| p(north,south,north,south,go_alone(X21))
| ~ epred1_0 )
& ( ~ p(north,south,north,south,X22)
| p(south,south,north,south,go_alone(X22))
| ~ epred1_0 )
& ( ~ p(south,south,south,north,X23)
| p(north,north,south,north,take_wolf(X23))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X24)
| p(south,south,south,north,take_wolf(X24))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X25)
| p(north,north,north,south,take_wolf(X25))
| ~ epred1_0 )
& ( ~ p(north,north,north,south,X26)
| p(south,south,north,south,take_wolf(X26))
| ~ epred1_0 )
& ( ~ p(south,X27,south,X28,X29)
| p(north,X27,north,X28,take_goat(X29))
| ~ epred1_0 )
& ( ~ p(north,X30,north,X31,X32)
| p(south,X30,south,X31,take_goat(X32))
| ~ epred1_0 )
& ( ~ p(south,north,south,south,X33)
| p(north,north,south,north,take_cabbage(X33))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X34)
| p(south,north,south,south,take_cabbage(X34))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X35)
| p(north,south,north,north,take_cabbage(X35))
| ~ epred1_0 )
& ( ~ p(north,south,north,north,X36)
| p(south,south,north,south,take_cabbage(X36))
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X20] :
( epred1_0
& ~ p(north,north,north,north,X20) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( p(north,X1,north,X2,take_goat(X3))
| ~ epred1_0
| ~ p(south,X1,south,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
~ p(north,north,north,north,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( p(north,X1,north,X2,take_goat(X3))
| ~ p(south,X1,south,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,plain,
( p(south,north,south,north,go_alone(X1))
| ~ epred1_0
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
~ p(south,north,south,north,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).
cnf(c_0_13,plain,
( p(north,north,south,north,take_cabbage(X1))
| ~ epred1_0
| ~ p(south,north,south,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( p(south,X1,south,X2,take_goat(X3))
| ~ epred1_0
| ~ p(north,X1,north,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( p(north,north,north,south,take_wolf(X1))
| ~ epred1_0
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
~ p(north,north,south,north,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( p(north,north,south,north,take_cabbage(X1))
| ~ p(south,north,south,south,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
cnf(c_0_18,plain,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]) ).
cnf(c_0_19,plain,
( p(north,north,north,south,take_wolf(X1))
| ~ p(south,south,north,south,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_7])]) ).
cnf(c_0_20,plain,
~ p(south,north,south,south,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( p(south,north,south,south,take_goat(take_wolf(X1)))
| ~ p(south,south,north,south,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( p(south,south,north,south,go_alone(X1))
| ~ epred1_0
| ~ p(north,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,plain,
~ p(south,south,north,south,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_7])]) ).
cnf(c_0_25,plain,
( p(south,south,south,south,start)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,plain,
~ p(north,south,north,south,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
p(south,south,south,south,start),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_7])]) ).
cnf(c_0_28,plain,
~ p(south,south,south,south,X1),
inference(spm,[status(thm)],[c_0_26,c_0_9]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun May 29 01:15:56 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39 # Preprocessing time : 0.015 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 30
% 0.20/1.39 # Proof object clause steps : 24
% 0.20/1.39 # Proof object formula steps : 6
% 0.20/1.39 # Proof object conjectures : 6
% 0.20/1.39 # Proof object clause conjectures : 3
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 9
% 0.20/1.39 # Proof object initial formulas used : 1
% 0.20/1.39 # Proof object generating inferences : 7
% 0.20/1.39 # Proof object simplifying inferences : 15
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 1
% 0.20/1.39 # Removed by relevancy pruning/SinE : 0
% 0.20/1.39 # Initial clauses : 17
% 0.20/1.39 # Removed in clause preprocessing : 0
% 0.20/1.39 # Initial clauses in saturation : 17
% 0.20/1.39 # Processed clauses : 41
% 0.20/1.39 # ...of these trivial : 0
% 0.20/1.39 # ...subsumed : 11
% 0.20/1.39 # ...remaining for further processing : 30
% 0.20/1.39 # Other redundant clauses eliminated : 0
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 0
% 0.20/1.39 # Backward-rewritten : 0
% 0.20/1.39 # Generated clauses : 28
% 0.20/1.39 # ...of the previous two non-trivial : 25
% 0.20/1.39 # Contextual simplify-reflections : 0
% 0.20/1.39 # Paramodulations : 27
% 0.20/1.39 # Factorizations : 0
% 0.20/1.39 # Equation resolutions : 0
% 0.20/1.39 # Current number of processed clauses : 29
% 0.20/1.39 # Positive orientable unit clauses : 1
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 10
% 0.20/1.39 # Non-unit-clauses : 18
% 0.20/1.39 # Current number of unprocessed clauses: 1
% 0.20/1.39 # ...number of literals in the above : 1
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 1
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 8
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 8
% 0.20/1.39 # Non-unit clause-clause subsumptions : 0
% 0.20/1.39 # Unit Clause-clause subsumption calls : 50
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 0
% 0.20/1.39 # BW rewrite match successes : 0
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 2109
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.014 s
% 0.20/1.39 # System time : 0.003 s
% 0.20/1.39 # Total time : 0.017 s
% 0.20/1.39 # Maximum resident set size: 2792 pages
%------------------------------------------------------------------------------