TSTP Solution File: SWW410-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Sat May 4 10:01:02 EDT 2024
% Result : Unsatisfiable 1.40s 0.61s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 19 unt; 10 nHn; 27 RR)
% Number of literals : 55 ( 19 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unfolding_2,axiom,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',unfolding_2) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',normalization) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',associative_commutative) ).
cnf(unfolding_5,axiom,
( X3 = X4
| heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))) ),
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',unfolding_5) ).
cnf(premise_5,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',premise_5) ).
cnf(premise_3,hypothesis,
x1 != x3,
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',premise_3) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',conclusion_1) ).
cnf(unfolding_3,axiom,
( heap(sep(lseg(X1,nil),X3))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
file('/export/starexec/sandbox2/tmp/tmp.QNE8Kfj6qt/E---3.1_11262.p',unfolding_3) ).
cnf(c_0_8,plain,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
inference(fof_simplification,[status(thm)],[unfolding_2]) ).
cnf(c_0_9,plain,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
c_0_8 ).
cnf(c_0_10,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_11,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_12,plain,
( X3 = X4
| heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))) ),
inference(fof_simplification,[status(thm)],[unfolding_5]) ).
cnf(c_0_13,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),X3))
| ~ heap(sep(next(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_15,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
premise_5 ).
cnf(c_0_16,hypothesis,
x1 != x3,
inference(fof_simplification,[status(thm)],[premise_3]) ).
cnf(c_0_17,plain,
( X3 = X4
| heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))) ),
c_0_12 ).
cnf(c_0_18,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),sep(X3,sep(X4,X5))))
| ~ heap(sep(X3,sep(X4,sep(next(X1,X2),X5)))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp)))),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,hypothesis,
x1 != x3,
c_0_16 ).
cnf(c_0_21,negated_conjecture,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
inference(fof_simplification,[status(thm)],[conclusion_1]) ).
cnf(c_0_22,plain,
( heap(sep(lseg(X1,nil),X3))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
inference(fof_simplification,[status(thm)],[unfolding_3]) ).
cnf(c_0_23,plain,
( X1 = X2
| heap(sep(lseg(X1,X3),sep(X4,X5)))
| ~ heap(sep(lseg(X2,X3),sep(X4,sep(next(X1,X2),X5)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_24,plain,
( X1 = X2
| heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X3,X5),sep(lseg(X5,X1),X4)))) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_25,hypothesis,
heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(lseg(x1,x3),emp)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_11]),c_0_11]) ).
cnf(c_0_26,negated_conjecture,
~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
c_0_21 ).
cnf(c_0_27,plain,
( heap(sep(lseg(X1,nil),X3))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
c_0_22 ).
cnf(c_0_28,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_20]),c_0_11]) ).
cnf(c_0_29,hypothesis,
x3 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_11]),c_0_26]) ).
cnf(c_0_30,hypothesis,
heap(sep(lseg(x2,nil),emp)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_10]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.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 : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 13:35:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.QNE8Kfj6qt/E---3.1_11262.p
% 1.40/0.61 # Version: 3.1.0
% 1.40/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.40/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.40/0.61 # Starting sh5l with 300s (1) cores
% 1.40/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11340 completed with status 0
% 1.40/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.40/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.61 # No SInE strategy applied
% 1.40/0.61 # Search class: FGUSS-FFSF22-MFFFFFNN
% 1.40/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.40/0.61 # Starting new_bool_3 with 226s (1) cores
% 1.40/0.61 # Starting new_bool_1 with 226s (1) cores
% 1.40/0.61 # Starting sh5l with 226s (1) cores
% 1.40/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11345 completed with status 0
% 1.40/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.40/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.61 # No SInE strategy applied
% 1.40/0.61 # Search class: FGUSS-FFSF22-MFFFFFNN
% 1.40/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.40/0.61 # Preprocessing time : 0.001 s
% 1.40/0.61 # Presaturation interreduction done
% 1.40/0.61
% 1.40/0.61 # Proof found!
% 1.40/0.61 # SZS status Unsatisfiable
% 1.40/0.61 # SZS output start CNFRefutation
% See solution above
% 1.40/0.61 # Parsed axioms : 17
% 1.40/0.61 # Removed by relevancy pruning/SinE : 0
% 1.40/0.61 # Initial clauses : 17
% 1.40/0.61 # Removed in clause preprocessing : 0
% 1.40/0.61 # Initial clauses in saturation : 17
% 1.40/0.61 # Processed clauses : 1189
% 1.40/0.61 # ...of these trivial : 4
% 1.40/0.61 # ...subsumed : 1056
% 1.40/0.61 # ...remaining for further processing : 129
% 1.40/0.61 # Other redundant clauses eliminated : 0
% 1.40/0.61 # Clauses deleted for lack of memory : 0
% 1.40/0.61 # Backward-subsumed : 2
% 1.40/0.61 # Backward-rewritten : 2
% 1.40/0.61 # Generated clauses : 10625
% 1.40/0.61 # ...of the previous two non-redundant : 10556
% 1.40/0.61 # ...aggressively subsumed : 0
% 1.40/0.61 # Contextual simplify-reflections : 0
% 1.40/0.61 # Paramodulations : 10625
% 1.40/0.61 # Factorizations : 0
% 1.40/0.61 # NegExts : 0
% 1.40/0.61 # Equation resolutions : 0
% 1.40/0.61 # Disequality decompositions : 0
% 1.40/0.61 # Total rewrite steps : 203
% 1.40/0.61 # ...of those cached : 117
% 1.40/0.61 # Propositional unsat checks : 0
% 1.40/0.61 # Propositional check models : 0
% 1.40/0.61 # Propositional check unsatisfiable : 0
% 1.40/0.61 # Propositional clauses : 0
% 1.40/0.61 # Propositional clauses after purity: 0
% 1.40/0.61 # Propositional unsat core size : 0
% 1.40/0.61 # Propositional preprocessing time : 0.000
% 1.40/0.61 # Propositional encoding time : 0.000
% 1.40/0.61 # Propositional solver time : 0.000
% 1.40/0.61 # Success case prop preproc time : 0.000
% 1.40/0.61 # Success case prop encoding time : 0.000
% 1.40/0.61 # Success case prop solver time : 0.000
% 1.40/0.61 # Current number of processed clauses : 108
% 1.40/0.61 # Positive orientable unit clauses : 6
% 1.40/0.61 # Positive unorientable unit clauses: 13
% 1.40/0.61 # Negative unit clauses : 21
% 1.40/0.61 # Non-unit-clauses : 68
% 1.40/0.61 # Current number of unprocessed clauses: 9395
% 1.40/0.61 # ...number of literals in the above : 17039
% 1.40/0.61 # Current number of archived formulas : 0
% 1.40/0.61 # Current number of archived clauses : 21
% 1.40/0.61 # Clause-clause subsumption calls (NU) : 2276
% 1.40/0.61 # Rec. Clause-clause subsumption calls : 2276
% 1.40/0.61 # Non-unit clause-clause subsumptions : 422
% 1.40/0.61 # Unit Clause-clause subsumption calls : 58
% 1.40/0.61 # Rewrite failures with RHS unbound : 0
% 1.40/0.61 # BW rewrite match attempts : 1776
% 1.40/0.61 # BW rewrite match successes : 683
% 1.40/0.61 # Condensation attempts : 0
% 1.40/0.61 # Condensation successes : 0
% 1.40/0.61 # Termbank termtop insertions : 146581
% 1.40/0.61 # Search garbage collected termcells : 35
% 1.40/0.61
% 1.40/0.61 # -------------------------------------------------
% 1.40/0.61 # User time : 0.148 s
% 1.40/0.61 # System time : 0.010 s
% 1.40/0.61 # Total time : 0.158 s
% 1.40/0.61 # Maximum resident set size: 1652 pages
% 1.40/0.61
% 1.40/0.61 # -------------------------------------------------
% 1.40/0.61 # User time : 0.764 s
% 1.40/0.61 # System time : 0.019 s
% 1.40/0.61 # Total time : 0.783 s
% 1.40/0.61 # Maximum resident set size: 1704 pages
% 1.40/0.61 % E---3.1 exiting
% 1.40/0.61 % E exiting
%------------------------------------------------------------------------------