TSTP Solution File: SWW425-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW425-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 20:09:22 EDT 2023
% Result : Timeout 876.55s 300.14s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 17 unt; 8 nHn; 21 RR)
% Number of literals : 37 ( 25 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 28 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
file('/export/starexec/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p',wellformedness_5) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p',associative_commutative) ).
cnf(premise_12,hypothesis,
heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
file('/export/starexec/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p',premise_12) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p',normalization) ).
cnf(premise_11,hypothesis,
x2 != x7,
file('/export/starexec/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p',premise_11) ).
cnf(premise_3,hypothesis,
x1 != x10,
file('/export/starexec/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p',premise_3) ).
cnf(c_0_6,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
wellformedness_5 ).
cnf(c_0_7,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_8,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(X4,sep(lseg(X1,X3),X5)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,hypothesis,
heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
premise_12 ).
cnf(c_0_10,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5)))) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,hypothesis,
heap(sep(lseg(x7,x6),sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x10),sep(lseg(x5,x7),emp))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_12,hypothesis,
( x1 = x2
| x10 = x2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_14,hypothesis,
( x1 = x2
| heap(sep(lseg(x7,x6),sep(lseg(x2,x1),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x2),sep(lseg(x5,x7),emp)))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,hypothesis,
( x1 = x2
| x5 = x2 ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,hypothesis,
( x1 = x2
| heap(sep(lseg(x7,x6),sep(lseg(x2,x7),sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x10),emp)))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_13]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_17,hypothesis,
x2 != x7,
premise_11 ).
cnf(c_0_18,hypothesis,
x1 = x2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_17]) ).
cnf(c_0_19,hypothesis,
x1 != x10,
premise_3 ).
cnf(c_0_20,hypothesis,
heap(sep(lseg(x7,x6),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x2),sep(lseg(x3,x10),sep(lseg(x5,x7),emp)))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_13]) ).
cnf(c_0_21,hypothesis,
x10 != x2,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_22,hypothesis,
x5 = x2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_20]),c_0_21]) ).
cnf(c_0_23,hypothesis,
heap(sep(lseg(x7,x6),sep(lseg(x2,x7),sep(lseg(x2,x10),sep(lseg(x6,x9),sep(lseg(x9,x2),sep(lseg(x3,x10),emp))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_18]),c_0_13]),c_0_18]),c_0_7]),c_0_13]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_21]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SWW425-1 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n020.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.38 % CPULimit : 2400
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Oct 2 22:30:31 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.8QP60h0p8j/E---3.1_19989.p
% 876.55/300.14 # Version: 3.1pre001
% 876.55/300.14 # Preprocessing class: FSMSSMSMSSSNFFN.
% 876.55/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 876.55/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 876.55/300.14 # Starting new_bool_3 with 300s (1) cores
% 876.55/300.14 # Starting new_bool_1 with 300s (1) cores
% 876.55/300.14 # Starting sh5l with 300s (1) cores
% 876.55/300.14 # new_bool_1 with pid 20087 completed with status 0
% 876.55/300.14 # Result found by new_bool_1
% 876.55/300.14 # Preprocessing class: FSMSSMSMSSSNFFN.
% 876.55/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 876.55/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 876.55/300.14 # Starting new_bool_3 with 300s (1) cores
% 876.55/300.14 # Starting new_bool_1 with 300s (1) cores
% 876.55/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 876.55/300.14 # Search class: FGUSS-FFSF22-DFFFFFNN
% 876.55/300.14 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 876.55/300.14 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 876.55/300.14 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 876.55/300.14 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 20090 completed with status 0
% 876.55/300.14 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 876.55/300.14 # Preprocessing class: FSMSSMSMSSSNFFN.
% 876.55/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 876.55/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 876.55/300.14 # Starting new_bool_3 with 300s (1) cores
% 876.55/300.14 # Starting new_bool_1 with 300s (1) cores
% 876.55/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 876.55/300.14 # Search class: FGUSS-FFSF22-DFFFFFNN
% 876.55/300.14 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 876.55/300.14 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 876.55/300.14 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 876.55/300.14 # Preprocessing time : 0.001 s
% 876.55/300.14 # Presaturation interreduction done
% 876.55/300.14
% 876.55/300.14 # Proof found!
% 876.55/300.14 # SZS status Unsatisfiable
% 876.55/300.14 # SZS output start CNFRefutation
% See solution above
% 876.55/300.14 # Parsed axioms : 24
% 876.55/300.14 # Removed by relevancy pruning/SinE : 7
% 876.55/300.14 # Initial clauses : 17
% 876.55/300.14 # Removed in clause preprocessing : 1
% 876.55/300.14 # Initial clauses in saturation : 16
% 876.55/300.14 # Processed clauses : 81
% 876.55/300.14 # ...of these trivial : 0
% 876.55/300.14 # ...subsumed : 34
% 876.55/300.14 # ...remaining for further processing : 47
% 876.55/300.14 # Other redundant clauses eliminated : 0
% 876.55/300.14 # Clauses deleted for lack of memory : 0
% 876.55/300.14 # Backward-subsumed : 0
% 876.55/300.14 # Backward-rewritten : 9
% 876.55/300.14 # Generated clauses : 122
% 876.55/300.14 # ...of the previous two non-redundant : 116
% 876.55/300.14 # ...aggressively subsumed : 0
% 876.55/300.14 # Contextual simplify-reflections : 0
% 876.55/300.14 # Paramodulations : 122
% 876.55/300.14 # Factorizations : 0
% 876.55/300.14 # NegExts : 0
% 876.55/300.14 # Equation resolutions : 0
% 876.55/300.14 # Total rewrite steps : 68
% 876.55/300.14 # Propositional unsat checks : 0
% 876.55/300.14 # Propositional check models : 0
% 876.55/300.14 # Propositional check unsatisfiable : 0
% 876.55/300.14 # Propositional clauses : 0
% 876.55/300.14 # Propositional clauses after purity: 0
% 876.55/300.14 # Propositional unsat core size : 0
% 876.55/300.14 # Propositional preprocessing time : 0.000
% 876.55/300.14 # Propositional encoding time : 0.000
% 876.55/300.14 # Propositional solver time : 0.000
% 876.55/300.14 # Success case prop preproc time : 0.000
% 876.55/300.14 # Success case prop encoding time : 0.000
% 876.55/300.14 # Success case prop solver time : 0.000
% 876.55/300.14 # Current number of processed clauses : 22
% 876.55/300.14 # Positive orientable unit clauses : 6
% 876.55/300.14 # Positive unorientable unit clauses: 2
% 876.55/300.14 # Negative unit clauses : 9
% 876.55/300.14 # Non-unit-clauses : 5
% 876.55/300.14 # Current number of unprocessed clauses: 66
% 876.55/300.14 # ...number of literals in the above : 148
% 876.55/300.14 # Current number of archived formulas : 0
% 876.55/300.14 # Current number of archived clauses : 25
% 876.55/300.14 # Clause-clause subsumption calls (NU) : 56
% 876.55/300.14 # Rec. Clause-clause subsumption calls : 56
% 876.55/300.14 # Non-unit clause-clause subsumptions : 22
% 876.55/300.14 # Unit Clause-clause subsumption calls : 45
% 876.55/300.14 # Rewrite failures with RHS unbound : 0
% 876.55/300.14 # BW rewrite match attempts : 34
% 876.55/300.14 # BW rewrite match successes : 15
% 876.55/300.14 # Condensation attempts : 0
% 876.55/300.14 # Condensation successes : 0
% 876.55/300.14 # Termbank termtop insertions : 1835
% 876.55/300.14
% 876.55/300.14 # -------------------------------------------------
% 876.55/300.14 # User time : 0.004 s
% 876.55/300.14 # System time : 0.003 s
% 876.55/300.14 # Total time : 0.007 s
% 876.55/300.14 # Maximum resident set size: 1640 pages
% 876.55/300.14
% 876.55/300.14 # -------------------------------------------------
% 876.55/300.14 # User time : 0.005 s
% 876.55/300.14 # System time : 0.006 s
% 876.55/300.14 # Total time : 0.011 s
% 876.55/300.14 # Maximum resident set size: 1700 pages
% 876.55/300.14 % E---3.1 exiting
% 876.55/300.14 % E---3.1 exiting
%------------------------------------------------------------------------------