TSTP Solution File: PUZ047+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ047+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:12:48 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 181 ( 0 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 209 ( 58 ~; 48 |; 57 &)
% ( 1 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 5 avg)
% Maximal term depth : 2 ( 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 ( 8 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/tmp/tmp.gMRAQd2wF2/E---3.1_14130.p',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,
! [X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38] :
( ( p(south,south,south,south,start)
| ~ epred1_0 )
& ( ~ p(south,north,south,north,X21)
| p(north,north,south,north,go_alone(X21))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X22)
| p(south,north,south,north,go_alone(X22))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X23)
| p(north,south,north,south,go_alone(X23))
| ~ epred1_0 )
& ( ~ p(north,south,north,south,X24)
| p(south,south,north,south,go_alone(X24))
| ~ epred1_0 )
& ( ~ p(south,south,south,north,X25)
| p(north,north,south,north,take_wolf(X25))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X26)
| p(south,south,south,north,take_wolf(X26))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X27)
| p(north,north,north,south,take_wolf(X27))
| ~ epred1_0 )
& ( ~ p(north,north,north,south,X28)
| p(south,south,north,south,take_wolf(X28))
| ~ epred1_0 )
& ( ~ p(south,X29,south,X30,X31)
| p(north,X29,north,X30,take_goat(X31))
| ~ epred1_0 )
& ( ~ p(north,X32,north,X33,X34)
| p(south,X32,south,X33,take_goat(X34))
| ~ epred1_0 )
& ( ~ p(south,north,south,south,X35)
| p(north,north,south,north,take_cabbage(X35))
| ~ epred1_0 )
& ( ~ p(north,north,south,north,X36)
| p(south,north,south,south,take_cabbage(X36))
| ~ epred1_0 )
& ( ~ p(south,south,north,south,X37)
| p(north,south,north,north,take_cabbage(X37))
| ~ epred1_0 )
& ( ~ p(north,south,north,north,X38)
| p(south,south,north,south,take_cabbage(X38))
| ~ epred1_0 ) ),
inference(distribute,[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(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))
| ~ p(south,X1,south,X2,X3)
| ~ epred1_0 ),
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,plain,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
~ p(north,north,north,north,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,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_11,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_8,c_0_7])]) ).
cnf(c_0_12,negated_conjecture,
~ p(south,north,south,north,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
~ p(north,north,south,north,X1),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
cnf(c_0_16,plain,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
~ p(south,south,south,north,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
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_16,c_0_7])]) ).
cnf(c_0_19,plain,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,plain,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,plain,
~ p(north,south,north,north,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_7])]) ).
cnf(c_0_23,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_20,c_0_7])]) ).
cnf(c_0_24,plain,
~ p(south,south,north,south,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
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(sr,[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_10]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PUZ047+1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 19:15:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.gMRAQd2wF2/E---3.1_14130.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 14208 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNF-FFMF11-SFFFFFNN
% 0.20/0.50 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 14213 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNF-FFMF11-SFFFFFNN
% 0.20/0.50 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 1
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 17
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 17
% 0.20/0.50 # Processed clauses : 41
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 7
% 0.20/0.50 # ...remaining for further processing : 34
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 3
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 11
% 0.20/0.50 # ...of the previous two non-redundant : 9
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 10
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 15
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 13
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 10
% 0.20/0.50 # Non-unit-clauses : 2
% 0.20/0.50 # Current number of unprocessed clauses: 2
% 0.20/0.50 # ...number of literals in the above : 4
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 21
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 8
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 8
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 11
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1839
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1888 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1704 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------