TSTP Solution File: PLA001-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PLA001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:10:17 EDT 2023
% Result : Unsatisfiable 20.74s 3.88s
% Output : CNFRefutation 20.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 20 unt; 0 nHn; 29 RR)
% Number of literals : 40 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(drive1,axiom,
( at(X5,X2,s(s(X3)),drive(X5,X4))
| ~ at(X1,X2,X3,X4)
| ~ next_to(X1,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',drive1) ).
cnf(initial,hypothesis,
at(cheyenne,none,start,initial_situation),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',initial) ).
cnf(map6,hypothesis,
next_to(cheyenne,northPlatte),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',map6) ).
cnf(map7,hypothesis,
next_to(northPlatte,grandIsland),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',map7) ).
cnf(buy_in_city,axiom,
( at(X1,s(X2),s(X3),buy(X4))
| ~ at(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',buy_in_city) ).
cnf(map8,hypothesis,
next_to(grandIsland,lincoln),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',map8) ).
cnf(map9,hypothesis,
next_to(lincoln,omaha),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',map9) ).
cnf(map10,hypothesis,
next_to(omaha,desMoines),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',map10) ).
cnf(prove_you_gat_get_there_with_bread,negated_conjecture,
~ at(desMoines,s(none),X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p',prove_you_gat_get_there_with_bread) ).
cnf(c_0_9,axiom,
( at(X5,X2,s(s(X3)),drive(X5,X4))
| ~ at(X1,X2,X3,X4)
| ~ next_to(X1,X5) ),
drive1 ).
cnf(c_0_10,hypothesis,
at(cheyenne,none,start,initial_situation),
initial ).
cnf(c_0_11,hypothesis,
( at(X1,none,s(s(start)),drive(X1,initial_situation))
| ~ next_to(cheyenne,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,hypothesis,
next_to(cheyenne,northPlatte),
map6 ).
cnf(c_0_13,hypothesis,
at(northPlatte,none,s(s(start)),drive(northPlatte,initial_situation)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,hypothesis,
( at(X1,none,s(s(s(s(start)))),drive(X1,drive(northPlatte,initial_situation)))
| ~ next_to(northPlatte,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_15,hypothesis,
next_to(northPlatte,grandIsland),
map7 ).
cnf(c_0_16,axiom,
( at(X1,s(X2),s(X3),buy(X4))
| ~ at(X1,X2,X3,X4) ),
buy_in_city ).
cnf(c_0_17,hypothesis,
at(grandIsland,none,s(s(s(s(start)))),drive(grandIsland,drive(northPlatte,initial_situation))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
at(grandIsland,s(none),s(s(s(s(s(start))))),buy(drive(grandIsland,drive(northPlatte,initial_situation)))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,hypothesis,
( at(X1,s(none),s(s(s(s(s(s(s(start))))))),drive(X1,buy(drive(grandIsland,drive(northPlatte,initial_situation)))))
| ~ next_to(grandIsland,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_20,hypothesis,
next_to(grandIsland,lincoln),
map8 ).
cnf(c_0_21,hypothesis,
at(lincoln,s(none),s(s(s(s(s(s(s(start))))))),drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation))))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,hypothesis,
( at(X1,s(none),s(s(s(s(s(s(s(s(s(start))))))))),drive(X1,drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation))))))
| ~ next_to(lincoln,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_23,hypothesis,
next_to(lincoln,omaha),
map9 ).
cnf(c_0_24,hypothesis,
at(omaha,s(none),s(s(s(s(s(s(s(s(s(start))))))))),drive(omaha,drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation)))))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
( at(X1,s(none),s(s(s(s(s(s(s(s(s(s(s(start))))))))))),drive(X1,drive(omaha,drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation)))))))
| ~ next_to(omaha,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
cnf(c_0_26,hypothesis,
next_to(omaha,desMoines),
map10 ).
cnf(c_0_27,negated_conjecture,
~ at(desMoines,s(none),X1,X2),
prove_you_gat_get_there_with_bread ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PLA001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.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 : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 20:09:39 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.JtGWarZ6Pa/E---3.1_20545.p
% 20.74/3.88 # Version: 3.1pre001
% 20.74/3.88 # Preprocessing class: FSMSSMSMSSSNFFN.
% 20.74/3.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.74/3.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 20.74/3.88 # Starting new_bool_3 with 300s (1) cores
% 20.74/3.88 # Starting new_bool_1 with 300s (1) cores
% 20.74/3.88 # Starting sh5l with 300s (1) cores
% 20.74/3.88 # new_bool_3 with pid 20623 completed with status 8
% 20.74/3.88 # new_bool_1 with pid 20624 completed with status 8
% 20.74/3.88 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 20622 completed with status 0
% 20.74/3.88 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 20.74/3.88 # Preprocessing class: FSMSSMSMSSSNFFN.
% 20.74/3.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.74/3.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 20.74/3.88 # No SInE strategy applied
% 20.74/3.88 # Search class: FHUNF-FFSM21-SFFFFFNN
% 20.74/3.88 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 20.74/3.88 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 20.74/3.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 20.74/3.88 # Starting new_bool_3 with 136s (1) cores
% 20.74/3.88 # Starting new_bool_1 with 136s (1) cores
% 20.74/3.88 # Starting sh5l with 136s (1) cores
% 20.74/3.88 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 20628 completed with status 0
% 20.74/3.88 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 20.74/3.88 # Preprocessing class: FSMSSMSMSSSNFFN.
% 20.74/3.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.74/3.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 20.74/3.88 # No SInE strategy applied
% 20.74/3.88 # Search class: FHUNF-FFSM21-SFFFFFNN
% 20.74/3.88 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 20.74/3.88 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 20.74/3.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 20.74/3.88 # Preprocessing time : 0.001 s
% 20.74/3.88 # Presaturation interreduction done
% 20.74/3.88
% 20.74/3.88 # Proof found!
% 20.74/3.88 # SZS status Unsatisfiable
% 20.74/3.88 # SZS output start CNFRefutation
% See solution above
% 20.74/3.88 # Parsed axioms : 16
% 20.74/3.88 # Removed by relevancy pruning/SinE : 0
% 20.74/3.88 # Initial clauses : 16
% 20.74/3.88 # Removed in clause preprocessing : 0
% 20.74/3.88 # Initial clauses in saturation : 16
% 20.74/3.88 # Processed clauses : 9877
% 20.74/3.88 # ...of these trivial : 0
% 20.74/3.88 # ...subsumed : 0
% 20.74/3.88 # ...remaining for further processing : 9877
% 20.74/3.88 # Other redundant clauses eliminated : 0
% 20.74/3.88 # Clauses deleted for lack of memory : 0
% 20.74/3.88 # Backward-subsumed : 0
% 20.74/3.88 # Backward-rewritten : 0
% 20.74/3.88 # Generated clauses : 19692
% 20.74/3.88 # ...of the previous two non-redundant : 19691
% 20.74/3.88 # ...aggressively subsumed : 0
% 20.74/3.88 # Contextual simplify-reflections : 0
% 20.74/3.88 # Paramodulations : 19692
% 20.74/3.88 # Factorizations : 0
% 20.74/3.88 # NegExts : 0
% 20.74/3.88 # Equation resolutions : 0
% 20.74/3.88 # Total rewrite steps : 0
% 20.74/3.88 # Propositional unsat checks : 0
% 20.74/3.88 # Propositional check models : 0
% 20.74/3.88 # Propositional check unsatisfiable : 0
% 20.74/3.88 # Propositional clauses : 0
% 20.74/3.88 # Propositional clauses after purity: 0
% 20.74/3.88 # Propositional unsat core size : 0
% 20.74/3.88 # Propositional preprocessing time : 0.000
% 20.74/3.88 # Propositional encoding time : 0.000
% 20.74/3.88 # Propositional solver time : 0.000
% 20.74/3.88 # Success case prop preproc time : 0.000
% 20.74/3.88 # Success case prop encoding time : 0.000
% 20.74/3.88 # Success case prop solver time : 0.000
% 20.74/3.88 # Current number of processed clauses : 9861
% 20.74/3.88 # Positive orientable unit clauses : 3292
% 20.74/3.88 # Positive unorientable unit clauses: 0
% 20.74/3.88 # Negative unit clauses : 1
% 20.74/3.88 # Non-unit-clauses : 6568
% 20.74/3.88 # Current number of unprocessed clauses: 9846
% 20.74/3.88 # ...number of literals in the above : 9846
% 20.74/3.88 # Current number of archived formulas : 0
% 20.74/3.88 # Current number of archived clauses : 16
% 20.74/3.88 # Clause-clause subsumption calls (NU) : 7543030
% 20.74/3.88 # Rec. Clause-clause subsumption calls : 7200722
% 20.74/3.88 # Non-unit clause-clause subsumptions : 0
% 20.74/3.88 # Unit Clause-clause subsumption calls : 187253
% 20.74/3.88 # Rewrite failures with RHS unbound : 0
% 20.74/3.88 # BW rewrite match attempts : 487952
% 20.74/3.88 # BW rewrite match successes : 0
% 20.74/3.88 # Condensation attempts : 0
% 20.74/3.88 # Condensation successes : 0
% 20.74/3.88 # Termbank termtop insertions : 758300
% 20.74/3.88
% 20.74/3.88 # -------------------------------------------------
% 20.74/3.88 # User time : 3.334 s
% 20.74/3.88 # System time : 0.058 s
% 20.74/3.88 # Total time : 3.392 s
% 20.74/3.88 # Maximum resident set size: 1644 pages
% 20.74/3.88
% 20.74/3.88 # -------------------------------------------------
% 20.74/3.88 # User time : 16.887 s
% 20.74/3.88 # System time : 0.181 s
% 20.74/3.88 # Total time : 17.069 s
% 20.74/3.88 # Maximum resident set size: 1684 pages
% 20.74/3.88 % E---3.1 exiting
%------------------------------------------------------------------------------