TSTP Solution File: PLA031-1.004 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PLA031-1.004 : TPTP v8.1.2. Released v3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:10:28 EDT 2023
% Result : Unsatisfiable 1127.52s 144.14s
% Output : CNFRefutation 1127.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 20
% Syntax : Number of clauses : 63 ( 34 unt; 0 nHn; 63 RR)
% Number of literals : 103 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-9 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 194 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk1,axiom,
( s(X1,X2,X3,X4,X10,X6,X7,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ path(X5,X10) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',walk1) ).
cnf(init,axiom,
s(s1,s0,s2,s0,s1,s2,s2,s0,s1),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',init) ).
cnf(map5,axiom,
path(s1,p1_2),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map5) ).
cnf(map8,axiom,
path(p1_2,s2),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map8) ).
cnf(walk3,axiom,
( s(X1,X2,X3,X4,X5,X6,X10,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ path(X7,X10) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',walk3) ).
cnf(map9,axiom,
path(s2,p2_0),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map9) ).
cnf(board9,axiom,
( s(X1,X2,X3,X4,X5,X6,truck1,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X7,X8)
| ~ neq(X5,truck1)
| ~ neq(X6,truck1) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',board9) ).
cnf(neq37,axiom,
neq(s2,truck1),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',neq37) ).
cnf(map12,axiom,
path(p2_0,s0),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map12) ).
cnf(load13,axiom,
( s(X1,X2,X3,truck1,X5,X6,X7,X4,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X4,X8) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',load13) ).
cnf(drive5,axiom,
( s(X1,X2,X3,X4,X5,X6,truck1,X9,X8)
| ~ s(X1,X2,X3,X4,X5,X6,truck1,X7,X8)
| ~ link(X7,X9) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',drive5) ).
cnf(map13,axiom,
link(s0,s2),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map13) ).
cnf(load14,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X4,X8)
| ~ s(X1,X2,X3,truck1,X5,X6,X7,X4,X8) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',load14) ).
cnf(load9,axiom,
( s(X1,X2,truck1,X4,X5,X6,X7,X3,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X3,X8) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',load9) ).
cnf(map17,axiom,
link(s2,s1),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map17) ).
cnf(load10,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X3,X8)
| ~ s(X1,X2,truck1,X4,X5,X6,X7,X3,X8) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',load10) ).
cnf(load1,axiom,
( s(truck1,X2,X3,X4,X5,X6,X7,X1,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X1,X8) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',load1) ).
cnf(map15,axiom,
link(s1,s0),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',map15) ).
cnf(load2,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X1,X8)
| ~ s(truck1,X2,X3,X4,X5,X6,X7,X1,X8) ),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',load2) ).
cnf(goal,negated_conjecture,
~ s(s0,s0,s1,s2,s2,X1,X2,s0,s1),
file('/export/starexec/sandbox/tmp/tmp.NBhLUGWTW2/E---3.1_26078.p',goal) ).
cnf(c_0_20,axiom,
( s(X1,X2,X3,X4,X10,X6,X7,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ path(X5,X10) ),
walk1 ).
cnf(c_0_21,axiom,
s(s1,s0,s2,s0,s1,s2,s2,s0,s1),
init ).
cnf(c_0_22,plain,
( s(s1,s0,s2,s0,X1,s2,s2,s0,s1)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
path(s1,p1_2),
map5 ).
cnf(c_0_24,plain,
s(s1,s0,s2,s0,p1_2,s2,s2,s0,s1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( s(s1,s0,s2,s0,X1,s2,s2,s0,s1)
| ~ path(p1_2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_26,axiom,
path(p1_2,s2),
map8 ).
cnf(c_0_27,axiom,
( s(X1,X2,X3,X4,X5,X6,X10,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ path(X7,X10) ),
walk3 ).
cnf(c_0_28,plain,
s(s1,s0,s2,s0,s2,s2,s2,s0,s1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( s(s1,s0,s2,s0,s2,s2,X1,s0,s1)
| ~ path(s2,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
path(s2,p2_0),
map9 ).
cnf(c_0_31,plain,
s(s1,s0,s2,s0,s2,s2,p2_0,s0,s1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,axiom,
( s(X1,X2,X3,X4,X5,X6,truck1,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X7,X8)
| ~ neq(X5,truck1)
| ~ neq(X6,truck1) ),
board9 ).
cnf(c_0_33,axiom,
neq(s2,truck1),
neq37 ).
cnf(c_0_34,plain,
( s(s1,s0,s2,s0,s2,s2,X1,s0,s1)
| ~ path(p2_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_35,axiom,
path(p2_0,s0),
map12 ).
cnf(c_0_36,plain,
( s(X1,X2,X3,X4,X5,s2,truck1,X6,X7)
| ~ neq(X5,truck1)
| ~ s(X1,X2,X3,X4,X5,s2,X6,X6,X7) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,axiom,
( s(X1,X2,X3,truck1,X5,X6,X7,X4,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X4,X8) ),
load13 ).
cnf(c_0_38,plain,
s(s1,s0,s2,s0,s2,s2,s0,s0,s1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( s(X1,X2,X3,X4,s2,s2,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,s2,s2,X5,X5,X6) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_40,plain,
s(s1,s0,s2,truck1,s2,s2,s0,s0,s1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,axiom,
( s(X1,X2,X3,X4,X5,X6,truck1,X9,X8)
| ~ s(X1,X2,X3,X4,X5,X6,truck1,X7,X8)
| ~ link(X7,X9) ),
drive5 ).
cnf(c_0_42,plain,
s(s1,s0,s2,truck1,s2,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( s(s1,s0,s2,truck1,s2,s2,truck1,X1,s1)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,axiom,
link(s0,s2),
map13 ).
cnf(c_0_45,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X4,X8)
| ~ s(X1,X2,X3,truck1,X5,X6,X7,X4,X8) ),
load14 ).
cnf(c_0_46,plain,
s(s1,s0,s2,truck1,s2,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,axiom,
( s(X1,X2,truck1,X4,X5,X6,X7,X3,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X3,X8) ),
load9 ).
cnf(c_0_48,plain,
s(s1,s0,s2,s2,s2,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
s(s1,s0,truck1,s2,s2,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
( s(s1,s0,truck1,s2,s2,s2,truck1,X1,s1)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_49]) ).
cnf(c_0_51,axiom,
link(s2,s1),
map17 ).
cnf(c_0_52,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X3,X8)
| ~ s(X1,X2,truck1,X4,X5,X6,X7,X3,X8) ),
load10 ).
cnf(c_0_53,plain,
s(s1,s0,truck1,s2,s2,s2,truck1,s1,s1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,axiom,
( s(truck1,X2,X3,X4,X5,X6,X7,X1,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X1,X8) ),
load1 ).
cnf(c_0_55,plain,
s(s1,s0,s1,s2,s2,s2,truck1,s1,s1),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
s(truck1,s0,s1,s2,s2,s2,truck1,s1,s1),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( s(truck1,s0,s1,s2,s2,s2,truck1,X1,s1)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
cnf(c_0_58,axiom,
link(s1,s0),
map15 ).
cnf(c_0_59,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X1,X8)
| ~ s(truck1,X2,X3,X4,X5,X6,X7,X1,X8) ),
load2 ).
cnf(c_0_60,plain,
s(truck1,s0,s1,s2,s2,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
~ s(s0,s0,s1,s2,s2,X1,X2,s0,s1),
goal ).
cnf(c_0_62,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PLA031-1.004 : TPTP v8.1.2. Released v3.5.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.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 20:14:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.NBhLUGWTW2/E---3.1_26078.p
% 1127.52/144.14 # Version: 3.1pre001
% 1127.52/144.14 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1127.52/144.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1127.52/144.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1127.52/144.14 # Starting new_bool_3 with 300s (1) cores
% 1127.52/144.14 # Starting new_bool_1 with 300s (1) cores
% 1127.52/144.14 # Starting sh5l with 300s (1) cores
% 1127.52/144.14 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26155 completed with status 0
% 1127.52/144.14 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1127.52/144.14 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1127.52/144.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1127.52/144.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1127.52/144.14 # No SInE strategy applied
% 1127.52/144.14 # Search class: FHUNF-FFMM00-SFFFFFNN
% 1127.52/144.14 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1127.52/144.14 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 811s (1) cores
% 1127.52/144.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1127.52/144.14 # Starting new_bool_3 with 136s (1) cores
% 1127.52/144.14 # Starting new_bool_1 with 136s (1) cores
% 1127.52/144.14 # Starting sh5l with 136s (1) cores
% 1127.52/144.14 # new_bool_3 with pid 26163 completed with status 7
% 1127.52/144.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 130s (1) cores
% 1127.52/144.14 # sh5l with pid 26165 completed with status 7
% 1127.52/144.14 # new_bool_1 with pid 26164 completed with status 7
% 1127.52/144.14 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 26161 completed with status 0
% 1127.52/144.14 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 1127.52/144.14 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1127.52/144.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1127.52/144.14 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1127.52/144.14 # No SInE strategy applied
% 1127.52/144.14 # Search class: FHUNF-FFMM00-SFFFFFNN
% 1127.52/144.14 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1127.52/144.14 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 811s (1) cores
% 1127.52/144.14 # Preprocessing time : 0.002 s
% 1127.52/144.14
% 1127.52/144.14 # Proof found!
% 1127.52/144.14 # SZS status Unsatisfiable
% 1127.52/144.14 # SZS output start CNFRefutation
% See solution above
% 1127.52/144.14 # Parsed axioms : 138
% 1127.52/144.14 # Removed by relevancy pruning/SinE : 0
% 1127.52/144.14 # Initial clauses : 138
% 1127.52/144.14 # Removed in clause preprocessing : 0
% 1127.52/144.14 # Initial clauses in saturation : 138
% 1127.52/144.14 # Processed clauses : 208129
% 1127.52/144.14 # ...of these trivial : 58202
% 1127.52/144.14 # ...subsumed : 0
% 1127.52/144.14 # ...remaining for further processing : 149927
% 1127.52/144.14 # Other redundant clauses eliminated : 0
% 1127.52/144.14 # Clauses deleted for lack of memory : 0
% 1127.52/144.14 # Backward-subsumed : 0
% 1127.52/144.14 # Backward-rewritten : 0
% 1127.52/144.14 # Generated clauses : 550716
% 1127.52/144.14 # ...of the previous two non-redundant : 412644
% 1127.52/144.14 # ...aggressively subsumed : 0
% 1127.52/144.14 # Contextual simplify-reflections : 0
% 1127.52/144.14 # Paramodulations : 550716
% 1127.52/144.14 # Factorizations : 0
% 1127.52/144.14 # NegExts : 0
% 1127.52/144.14 # Equation resolutions : 0
% 1127.52/144.14 # Total rewrite steps : 196273
% 1127.52/144.14 # Propositional unsat checks : 0
% 1127.52/144.14 # Propositional check models : 0
% 1127.52/144.14 # Propositional check unsatisfiable : 0
% 1127.52/144.14 # Propositional clauses : 0
% 1127.52/144.14 # Propositional clauses after purity: 0
% 1127.52/144.14 # Propositional unsat core size : 0
% 1127.52/144.14 # Propositional preprocessing time : 0.000
% 1127.52/144.14 # Propositional encoding time : 0.000
% 1127.52/144.14 # Propositional solver time : 0.000
% 1127.52/144.14 # Success case prop preproc time : 0.000
% 1127.52/144.14 # Success case prop encoding time : 0.000
% 1127.52/144.14 # Success case prop solver time : 0.000
% 1127.52/144.14 # Current number of processed clauses : 149927
% 1127.52/144.14 # Positive orientable unit clauses : 65200
% 1127.52/144.14 # Positive unorientable unit clauses: 0
% 1127.52/144.14 # Negative unit clauses : 10
% 1127.52/144.14 # Non-unit-clauses : 84717
% 1127.52/144.14 # Current number of unprocessed clauses: 204646
% 1127.52/144.14 # ...number of literals in the above : 317191
% 1127.52/144.14 # Current number of archived formulas : 0
% 1127.52/144.14 # Current number of archived clauses : 0
% 1127.52/144.14 # Clause-clause subsumption calls (NU) : 157424562
% 1127.52/144.14 # Rec. Clause-clause subsumption calls : 157424541
% 1127.52/144.14 # Non-unit clause-clause subsumptions : 0
% 1127.52/144.14 # Unit Clause-clause subsumption calls : 257636856
% 1127.52/144.14 # Rewrite failures with RHS unbound : 0
% 1127.52/144.14 # BW rewrite match attempts : 231959560
% 1127.52/144.14 # BW rewrite match successes : 0
% 1127.52/144.14 # Condensation attempts : 0
% 1127.52/144.14 # Condensation successes : 0
% 1127.52/144.14 # Termbank termtop insertions : 8825651
% 1127.52/144.14
% 1127.52/144.14 # -------------------------------------------------
% 1127.52/144.14 # User time : 550.111 s
% 1127.52/144.14 # System time : 0.579 s
% 1127.52/144.14 # Total time : 550.690 s
% 1127.52/144.14 # Maximum resident set size: 1908 pages
% 1127.52/144.14
% 1127.52/144.14 # -------------------------------------------------
% 1127.52/144.14 # User time : 698.535 s
% 1127.52/144.14 # System time : 1.629 s
% 1127.52/144.14 # Total time : 700.164 s
% 1127.52/144.14 # Maximum resident set size: 1752 pages
% 1127.52/144.14 % E---3.1 exiting
%------------------------------------------------------------------------------