TSTP Solution File: PUZ047-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PUZ047-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Tue May 21 02:26:02 EDT 2024
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 13 unt; 0 nHn; 31 RR)
% Number of literals : 49 ( 0 equ; 28 neg)
% Maximal clause size : 2 ( 1 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 : 40 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(thm100_16,negated_conjecture,
~ p(north,north,north,north,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_16) ).
cnf(thm100_10,negated_conjecture,
( p(north,X1,north,X2,take_goat(X3))
| ~ p(south,X1,south,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_10) ).
cnf(thm100_3,negated_conjecture,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_3) ).
cnf(thm100_6,negated_conjecture,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_6) ).
cnf(thm100_11,negated_conjecture,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_11) ).
cnf(thm100_14,negated_conjecture,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_14) ).
cnf(thm100_5,negated_conjecture,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_5) ).
cnf(thm100_1,negated_conjecture,
p(south,south,south,south,start),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm100_1) ).
cnf(c_0_8,negated_conjecture,
~ p(north,north,north,north,X1),
inference(fof_simplification,[status(thm)],[thm100_16]) ).
cnf(c_0_9,negated_conjecture,
( p(north,X1,north,X2,take_goat(X3))
| ~ p(south,X1,south,X2,X3) ),
inference(fof_simplification,[status(thm)],[thm100_10]) ).
cnf(c_0_10,negated_conjecture,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
inference(fof_simplification,[status(thm)],[thm100_3]) ).
cnf(c_0_11,negated_conjecture,
~ p(north,north,north,north,X1),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
( p(north,X1,north,X2,take_goat(X3))
| ~ p(south,X1,south,X2,X3) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
inference(fof_simplification,[status(thm)],[thm100_6]) ).
cnf(c_0_14,negated_conjecture,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
~ p(south,north,south,north,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
~ p(north,north,south,north,X1),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3) ),
inference(fof_simplification,[status(thm)],[thm100_11]) ).
cnf(c_0_19,negated_conjecture,
~ p(south,south,south,north,X1),
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3) ),
c_0_18 ).
cnf(c_0_21,negated_conjecture,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
inference(fof_simplification,[status(thm)],[thm100_14]) ).
cnf(c_0_22,negated_conjecture,
~ p(north,south,north,north,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
inference(fof_simplification,[status(thm)],[thm100_5]) ).
cnf(c_0_25,negated_conjecture,
~ p(south,south,north,south,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
~ p(north,south,north,south,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
p(south,south,south,south,start),
thm100_1 ).
cnf(c_0_29,negated_conjecture,
~ p(south,south,south,south,X1),
inference(spm,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : PUZ047-1 : TPTP v8.2.0. Released v2.5.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n005.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 10:28:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.51 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/benchmark/theBenchmark.p
% 0.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_3 with pid 7804 completed with status 0
% 0.23/0.53 # Result found by new_bool_3
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FHUNF-FFSF11-SFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # SAT001_MinMin_p005000_rr_RG with pid 7808 completed with status 0
% 0.23/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FHUNF-FFSF11-SFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 16
% 0.23/0.53 # Removed by relevancy pruning/SinE : 0
% 0.23/0.53 # Initial clauses : 16
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 16
% 0.23/0.53 # Processed clauses : 38
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 3
% 0.23/0.53 # ...remaining for further processing : 35
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 7
% 0.23/0.53 # Backward-rewritten : 0
% 0.23/0.53 # Generated clauses : 11
% 0.23/0.53 # ...of the previous two non-redundant : 9
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 10
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 0
% 0.23/0.53 # ...of those cached : 0
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 11
% 0.23/0.53 # Positive orientable unit clauses : 0
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 9
% 0.23/0.53 # Non-unit-clauses : 2
% 0.23/0.53 # Current number of unprocessed clauses: 3
% 0.23/0.53 # ...number of literals in the above : 5
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 24
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 12
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 12
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 17
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 0
% 0.23/0.53 # BW rewrite match successes : 0
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 929
% 0.23/0.53 # Search garbage collected termcells : 36
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.003 s
% 0.23/0.53 # System time : 0.002 s
% 0.23/0.53 # Total time : 0.005 s
% 0.23/0.53 # Maximum resident set size: 1604 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.004 s
% 0.23/0.53 # System time : 0.004 s
% 0.23/0.53 # Total time : 0.008 s
% 0.23/0.53 # Maximum resident set size: 1696 pages
% 0.23/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------