TSTP Solution File: SWW437-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWW437-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 06:45:38 EDT 2024
% Result : Unsatisfiable 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 20 unt; 5 nHn; 21 RR)
% Number of literals : 33 ( 22 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-2 aty)
% Number of variables : 22 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).
cnf(premise_27,hypothesis,
heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_27) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
cnf(premise_10,hypothesis,
x7 != x16,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_10) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(premise_6,hypothesis,
x3 != x8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_6) ).
cnf(c_0_6,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
inference(fof_simplification,[status(thm)],[wellformedness_5]) ).
cnf(c_0_7,hypothesis,
heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))),
premise_27 ).
cnf(c_0_8,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
c_0_6 ).
cnf(c_0_10,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x7,x1),sep(lseg(x3,x16),sep(lseg(x3,x12),sep(lseg(x12,x8),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),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)],[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_7,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_11,hypothesis,
( x7 = x16
| x3 = x16 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,hypothesis,
x7 != x16,
inference(fof_simplification,[status(thm)],[premise_10]) ).
cnf(c_0_13,hypothesis,
( x7 = x16
| heap(sep(lseg(x16,x7),sep(lseg(x16,x16),sep(lseg(x7,x1),sep(lseg(x16,x16),sep(lseg(x16,x12),sep(lseg(x12,x8),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),emp)))))))))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
x7 != x16,
c_0_12 ).
cnf(c_0_15,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x16),sep(lseg(x7,x1),sep(lseg(x16,x16),sep(lseg(x16,x12),sep(lseg(x12,x8),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),emp)))))))))))),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_17,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x12),sep(lseg(x7,x1),sep(lseg(x12,x8),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),emp)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_8]),c_0_16]),c_0_8]),c_0_16]) ).
cnf(c_0_18,hypothesis,
x3 != x8,
inference(fof_simplification,[status(thm)],[premise_6]) ).
cnf(c_0_19,hypothesis,
x12 = x16,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_14]) ).
cnf(c_0_20,hypothesis,
x3 = x16,
inference(sr,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_21,hypothesis,
x3 != x8,
c_0_18 ).
cnf(c_0_22,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x8),sep(lseg(x7,x1),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),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(spm,[status(thm)],[c_0_10,c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_16]),c_0_16]),c_0_16]),c_0_8]) ).
cnf(c_0_23,hypothesis,
x8 != x16,
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_14]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWW437-1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 19:39:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 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/benchmark/theBenchmark.p
% 0.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_1 with pid 28539 completed with status 0
% 0.18/0.47 # Result found by new_bool_1
% 0.18/0.47 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.18/0.47 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.18/0.47 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 28544 completed with status 0
% 0.18/0.47 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.18/0.47 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.18/0.47 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 39
% 0.18/0.47 # Removed by relevancy pruning/SinE : 7
% 0.18/0.47 # Initial clauses : 32
% 0.18/0.47 # Removed in clause preprocessing : 1
% 0.18/0.47 # Initial clauses in saturation : 31
% 0.18/0.47 # Processed clauses : 110
% 0.18/0.47 # ...of these trivial : 6
% 0.18/0.47 # ...subsumed : 24
% 0.18/0.47 # ...remaining for further processing : 79
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 9
% 0.18/0.47 # Generated clauses : 122
% 0.18/0.47 # ...of the previous two non-redundant : 121
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 120
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 79
% 0.18/0.47 # ...of those cached : 24
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 37
% 0.18/0.47 # Positive orientable unit clauses : 7
% 0.18/0.47 # Positive unorientable unit clauses: 2
% 0.18/0.47 # Negative unit clauses : 23
% 0.18/0.47 # Non-unit-clauses : 5
% 0.18/0.47 # Current number of unprocessed clauses: 73
% 0.18/0.47 # ...number of literals in the above : 153
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 42
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 53
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 53
% 0.18/0.47 # Non-unit clause-clause subsumptions : 21
% 0.18/0.47 # Unit Clause-clause subsumption calls : 476
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 51
% 0.18/0.47 # BW rewrite match successes : 28
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 2165
% 0.18/0.47 # Search garbage collected termcells : 110
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.006 s
% 0.18/0.47 # System time : 0.002 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1796 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.007 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.011 s
% 0.18/0.47 # Maximum resident set size: 1744 pages
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------