TSTP Solution File: PLA031-1.003 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PLA031-1.003 : TPTP v8.1.2. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:09:59 EDT 2023
% Result : Unsatisfiable 36.90s 5.10s
% Output : CNFRefutation 36.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 21
% Syntax : Number of clauses : 67 ( 36 unt; 0 nHn; 67 RR)
% Number of literals : 106 ( 0 equ; 41 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-8 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 182 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk2,axiom,
( s(X1,X2,X3,X4,X5,X9,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X6,X9) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',walk2) ).
cnf(init,axiom,
s(s1,s2,s2,s0,s2,s0,s1,s1),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',init) ).
cnf(map1,axiom,
path(s0,p0_1),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map1) ).
cnf(map4,axiom,
path(p0_1,s1),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map4) ).
cnf(board5,axiom,
( s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ neq(X5,truck1) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',board5) ).
cnf(neq33,axiom,
neq(s2,truck1),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',neq33) ).
cnf(load1,axiom,
( s(truck1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',load1) ).
cnf(drive3,axiom,
( s(X1,X2,X3,X4,X5,truck1,X8,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ link(X6,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',drive3) ).
cnf(map13,axiom,
link(s1,s2),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map13) ).
cnf(load2,axiom,
( s(X1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',load2) ).
cnf(load9,axiom,
( s(X1,X2,truck1,X4,X5,X6,X3,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X3,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',load9) ).
cnf(map15,axiom,
link(s2,s0),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map15) ).
cnf(load10,axiom,
( s(X1,X2,X3,X4,X5,X6,X3,X7)
| ~ s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',load10) ).
cnf(load13,axiom,
( s(X1,X2,X3,truck1,X5,X6,X4,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X4,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',load13) ).
cnf(map16,axiom,
link(s0,s2),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map16) ).
cnf(load14,axiom,
( s(X1,X2,X3,X4,X5,X6,X4,X7)
| ~ s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',load14) ).
cnf(board6,axiom,
( s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',board6) ).
cnf(walk1,axiom,
( s(X1,X2,X3,X4,X9,X6,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X5,X9) ),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',walk1) ).
cnf(map7,axiom,
path(s2,p1_2),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map7) ).
cnf(map6,axiom,
path(p1_2,s1),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',map6) ).
cnf(goal,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
file('/export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p',goal) ).
cnf(c_0_21,axiom,
( s(X1,X2,X3,X4,X5,X9,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X6,X9) ),
walk2 ).
cnf(c_0_22,axiom,
s(s1,s2,s2,s0,s2,s0,s1,s1),
init ).
cnf(c_0_23,plain,
( s(s1,s2,s2,s0,s2,X1,s1,s1)
| ~ path(s0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,axiom,
path(s0,p0_1),
map1 ).
cnf(c_0_25,plain,
s(s1,s2,s2,s0,s2,p0_1,s1,s1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( s(s1,s2,s2,s0,s2,X1,s1,s1)
| ~ path(p0_1,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_27,axiom,
path(p0_1,s1),
map4 ).
cnf(c_0_28,axiom,
( s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ neq(X5,truck1) ),
board5 ).
cnf(c_0_29,axiom,
neq(s2,truck1),
neq33 ).
cnf(c_0_30,axiom,
( s(truck1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X1,X7) ),
load1 ).
cnf(c_0_31,plain,
s(s1,s2,s2,s0,s2,s1,s1,s1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( s(X1,X2,X3,X4,s2,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,s2,X5,X5,X6) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
s(truck1,s2,s2,s0,s2,s1,s1,s1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,axiom,
( s(X1,X2,X3,X4,X5,truck1,X8,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ link(X6,X8) ),
drive3 ).
cnf(c_0_35,plain,
s(truck1,s2,s2,s0,s2,truck1,s1,s1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( s(truck1,s2,s2,s0,s2,truck1,X1,s1)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,axiom,
link(s1,s2),
map13 ).
cnf(c_0_38,axiom,
( s(X1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
load2 ).
cnf(c_0_39,plain,
s(truck1,s2,s2,s0,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,axiom,
( s(X1,X2,truck1,X4,X5,X6,X3,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X3,X7) ),
load9 ).
cnf(c_0_41,plain,
s(s2,s2,s2,s0,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
s(s2,s2,truck1,s0,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,plain,
( s(s2,s2,truck1,s0,s2,truck1,X1,s1)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_42]) ).
cnf(c_0_44,axiom,
link(s2,s0),
map15 ).
cnf(c_0_45,axiom,
( s(X1,X2,X3,X4,X5,X6,X3,X7)
| ~ s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
load10 ).
cnf(c_0_46,plain,
s(s2,s2,truck1,s0,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,axiom,
( s(X1,X2,X3,truck1,X5,X6,X4,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X4,X7) ),
load13 ).
cnf(c_0_48,plain,
s(s2,s2,s0,s0,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
s(s2,s2,s0,truck1,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
( s(s2,s2,s0,truck1,s2,truck1,X1,s1)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_49]) ).
cnf(c_0_51,axiom,
link(s0,s2),
map16 ).
cnf(c_0_52,axiom,
( s(X1,X2,X3,X4,X5,X6,X4,X7)
| ~ s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
load14 ).
cnf(c_0_53,plain,
s(s2,s2,s0,truck1,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
s(s2,s2,s0,s2,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,plain,
( s(s2,s2,s0,s2,s2,truck1,X1,s1)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_54]) ).
cnf(c_0_56,axiom,
( s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7) ),
board6 ).
cnf(c_0_57,plain,
s(s2,s2,s0,s2,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_55,c_0_44]) ).
cnf(c_0_58,axiom,
( s(X1,X2,X3,X4,X9,X6,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X5,X9) ),
walk1 ).
cnf(c_0_59,plain,
s(s2,s2,s0,s2,s2,s0,s0,s1),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
( s(s2,s2,s0,s2,X1,s0,s0,s1)
| ~ path(s2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,axiom,
path(s2,p1_2),
map7 ).
cnf(c_0_62,plain,
s(s2,s2,s0,s2,p1_2,s0,s0,s1),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,plain,
( s(s2,s2,s0,s2,X1,s0,s0,s1)
| ~ path(p1_2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_62]) ).
cnf(c_0_64,axiom,
path(p1_2,s1),
map6 ).
cnf(c_0_65,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
goal ).
cnf(c_0_66,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : PLA031-1.003 : TPTP v8.1.2. Released v3.5.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n031.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 20:44:13 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.mNXmWN8ZPr/E---3.1_21319.p
% 36.90/5.10 # Version: 3.1pre001
% 36.90/5.10 # Preprocessing class: FSLSSMSMSSSNFFN.
% 36.90/5.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.90/5.10 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 36.90/5.10 # Starting new_bool_3 with 300s (1) cores
% 36.90/5.10 # Starting new_bool_1 with 300s (1) cores
% 36.90/5.10 # Starting sh5l with 300s (1) cores
% 36.90/5.10 # sh5l with pid 21400 completed with status 0
% 36.90/5.10 # Result found by sh5l
% 36.90/5.10 # Preprocessing class: FSLSSMSMSSSNFFN.
% 36.90/5.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.90/5.10 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 36.90/5.10 # Starting new_bool_3 with 300s (1) cores
% 36.90/5.10 # Starting new_bool_1 with 300s (1) cores
% 36.90/5.10 # Starting sh5l with 300s (1) cores
% 36.90/5.10 # SinE strategy is gf500_gu_R04_F100_L20000
% 36.90/5.10 # Search class: FHUNF-FFMM00-SFFFFFNN
% 36.90/5.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 36.90/5.10 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 181s (1) cores
% 36.90/5.10 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 21407 completed with status 0
% 36.90/5.10 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 36.90/5.10 # Preprocessing class: FSLSSMSMSSSNFFN.
% 36.90/5.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.90/5.10 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 36.90/5.10 # Starting new_bool_3 with 300s (1) cores
% 36.90/5.10 # Starting new_bool_1 with 300s (1) cores
% 36.90/5.10 # Starting sh5l with 300s (1) cores
% 36.90/5.10 # SinE strategy is gf500_gu_R04_F100_L20000
% 36.90/5.10 # Search class: FHUNF-FFMM00-SFFFFFNN
% 36.90/5.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 36.90/5.10 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 181s (1) cores
% 36.90/5.10 # Preprocessing time : 0.001 s
% 36.90/5.10
% 36.90/5.10 # Proof found!
% 36.90/5.10 # SZS status Unsatisfiable
% 36.90/5.10 # SZS output start CNFRefutation
% See solution above
% 36.90/5.10 # Parsed axioms : 112
% 36.90/5.10 # Removed by relevancy pruning/SinE : 0
% 36.90/5.10 # Initial clauses : 112
% 36.90/5.10 # Removed in clause preprocessing : 0
% 36.90/5.10 # Initial clauses in saturation : 112
% 36.90/5.10 # Processed clauses : 32164
% 36.90/5.10 # ...of these trivial : 8258
% 36.90/5.10 # ...subsumed : 0
% 36.90/5.10 # ...remaining for further processing : 23906
% 36.90/5.10 # Other redundant clauses eliminated : 0
% 36.90/5.10 # Clauses deleted for lack of memory : 0
% 36.90/5.10 # Backward-subsumed : 0
% 36.90/5.10 # Backward-rewritten : 0
% 36.90/5.10 # Generated clauses : 80856
% 36.90/5.10 # ...of the previous two non-redundant : 56728
% 36.90/5.10 # ...aggressively subsumed : 0
% 36.90/5.10 # Contextual simplify-reflections : 0
% 36.90/5.10 # Paramodulations : 80856
% 36.90/5.10 # Factorizations : 0
% 36.90/5.10 # NegExts : 0
% 36.90/5.10 # Equation resolutions : 0
% 36.90/5.10 # Total rewrite steps : 32385
% 36.90/5.10 # Propositional unsat checks : 0
% 36.90/5.10 # Propositional check models : 0
% 36.90/5.10 # Propositional check unsatisfiable : 0
% 36.90/5.10 # Propositional clauses : 0
% 36.90/5.10 # Propositional clauses after purity: 0
% 36.90/5.10 # Propositional unsat core size : 0
% 36.90/5.10 # Propositional preprocessing time : 0.000
% 36.90/5.10 # Propositional encoding time : 0.000
% 36.90/5.10 # Propositional solver time : 0.000
% 36.90/5.10 # Success case prop preproc time : 0.000
% 36.90/5.10 # Success case prop encoding time : 0.000
% 36.90/5.10 # Success case prop solver time : 0.000
% 36.90/5.10 # Current number of processed clauses : 23906
% 36.90/5.10 # Positive orientable unit clauses : 11947
% 36.90/5.10 # Positive unorientable unit clauses: 0
% 36.90/5.10 # Negative unit clauses : 9
% 36.90/5.10 # Non-unit-clauses : 11950
% 36.90/5.10 # Current number of unprocessed clauses: 24676
% 36.90/5.10 # ...number of literals in the above : 37315
% 36.90/5.10 # Current number of archived formulas : 0
% 36.90/5.10 # Current number of archived clauses : 0
% 36.90/5.10 # Clause-clause subsumption calls (NU) : 3335879
% 36.90/5.10 # Rec. Clause-clause subsumption calls : 3333117
% 36.90/5.10 # Non-unit clause-clause subsumptions : 0
% 36.90/5.10 # Unit Clause-clause subsumption calls : 7639578
% 36.90/5.10 # Rewrite failures with RHS unbound : 0
% 36.90/5.10 # BW rewrite match attempts : 6221471
% 36.90/5.10 # BW rewrite match successes : 0
% 36.90/5.10 # Condensation attempts : 0
% 36.90/5.10 # Condensation successes : 0
% 36.90/5.10 # Termbank termtop insertions : 1187600
% 36.90/5.10
% 36.90/5.10 # -------------------------------------------------
% 36.90/5.10 # User time : 4.597 s
% 36.90/5.10 # System time : 0.076 s
% 36.90/5.10 # Total time : 4.673 s
% 36.90/5.10 # Maximum resident set size: 1840 pages
% 36.90/5.10
% 36.90/5.10 # -------------------------------------------------
% 36.90/5.10 # User time : 4.599 s
% 36.90/5.10 # System time : 0.077 s
% 36.90/5.10 # Total time : 4.676 s
% 36.90/5.10 # Maximum resident set size: 1732 pages
% 36.90/5.10 % E---3.1 exiting
% 36.90/5.11 % E---3.1 exiting
%------------------------------------------------------------------------------