TSTP Solution File: SWW409-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW409-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% 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 : Mon Jun 24 18:14:28 EDT 2024
% Result : Unsatisfiable 1.18s 0.65s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 16 unt; 5 nHn; 21 RR)
% Number of literals : 41 ( 13 equ; 16 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 : 51 ( 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.aL6VJzb3IM/E---3.1_17433.p',unfolding_2) ).
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.aL6VJzb3IM/E---3.1_17433.p',unfolding_3) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.aL6VJzb3IM/E---3.1_17433.p',normalization) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.aL6VJzb3IM/E---3.1_17433.p',associative_commutative) ).
cnf(premise_3,hypothesis,
x1 != x3,
file('/export/starexec/sandbox2/tmp/tmp.aL6VJzb3IM/E---3.1_17433.p',premise_3) ).
cnf(premise_5,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
file('/export/starexec/sandbox2/tmp/tmp.aL6VJzb3IM/E---3.1_17433.p',premise_5) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x2,nil),emp)),
file('/export/starexec/sandbox2/tmp/tmp.aL6VJzb3IM/E---3.1_17433.p',conclusion_1) ).
cnf(c_0_7,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_8,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_9,plain,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
c_0_7 ).
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,
( heap(sep(lseg(X1,nil),X3))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
c_0_8 ).
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,
x1 != x3,
inference(fof_simplification,[status(thm)],[premise_3]) ).
cnf(c_0_16,plain,
( heap(sep(lseg(X1,nil),sep(X2,X3)))
| ~ heap(sep(lseg(X1,X4),sep(X2,sep(lseg(X4,nil),X3)))) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,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_18,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
premise_5 ).
cnf(c_0_19,hypothesis,
x1 != x3,
c_0_15 ).
cnf(c_0_20,plain,
( heap(sep(lseg(X1,nil),sep(X2,X3)))
| ~ heap(sep(X2,sep(lseg(X1,X4),sep(lseg(X4,nil),X3)))) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_21,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x1,x3),sep(lseg(x3,nil),emp)))),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_11]) ).
cnf(c_0_22,negated_conjecture,
~ heap(sep(lseg(x2,nil),emp)),
inference(fof_simplification,[status(thm)],[conclusion_1]) ).
cnf(c_0_23,hypothesis,
heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_11]) ).
cnf(c_0_24,negated_conjecture,
~ heap(sep(lseg(x2,nil),emp)),
c_0_22 ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW409-1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.13 % Command : run_E %s %d SAT
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jun 19 07:56:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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/tmp/tmp.aL6VJzb3IM/E---3.1_17433.p
% 1.18/0.65 # Version: 3.2.0
% 1.18/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.65 # Starting sh5l with 300s (1) cores
% 1.18/0.65 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17510 completed with status 0
% 1.18/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.18/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.65 # No SInE strategy applied
% 1.18/0.65 # Search class: FGUSS-FFSF22-MFFFFFNN
% 1.18/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.18/0.65 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.18/0.65 # Starting new_bool_3 with 226s (1) cores
% 1.18/0.65 # Starting new_bool_1 with 226s (1) cores
% 1.18/0.65 # Starting sh5l with 226s (1) cores
% 1.18/0.65 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17515 completed with status 0
% 1.18/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.18/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.65 # No SInE strategy applied
% 1.18/0.65 # Search class: FGUSS-FFSF22-MFFFFFNN
% 1.18/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.18/0.65 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.18/0.65 # Preprocessing time : 0.001 s
% 1.18/0.65 # Presaturation interreduction done
% 1.18/0.65
% 1.18/0.65 # Proof found!
% 1.18/0.65 # SZS status Unsatisfiable
% 1.18/0.65 # SZS output start CNFRefutation
% See solution above
% 1.18/0.65 # Parsed axioms : 17
% 1.18/0.65 # Removed by relevancy pruning/SinE : 0
% 1.18/0.65 # Initial clauses : 17
% 1.18/0.65 # Removed in clause preprocessing : 0
% 1.18/0.65 # Initial clauses in saturation : 17
% 1.18/0.65 # Processed clauses : 1200
% 1.18/0.65 # ...of these trivial : 4
% 1.18/0.65 # ...subsumed : 1068
% 1.18/0.65 # ...remaining for further processing : 128
% 1.18/0.65 # Other redundant clauses eliminated : 0
% 1.18/0.65 # Clauses deleted for lack of memory : 0
% 1.18/0.65 # Backward-subsumed : 3
% 1.18/0.65 # Backward-rewritten : 0
% 1.18/0.65 # Generated clauses : 10624
% 1.18/0.65 # ...of the previous two non-redundant : 10555
% 1.18/0.65 # ...aggressively subsumed : 0
% 1.18/0.65 # Contextual simplify-reflections : 0
% 1.18/0.65 # Paramodulations : 10624
% 1.18/0.65 # Factorizations : 0
% 1.18/0.65 # NegExts : 0
% 1.18/0.65 # Equation resolutions : 0
% 1.18/0.65 # Disequality decompositions : 0
% 1.18/0.65 # Total rewrite steps : 188
% 1.18/0.65 # ...of those cached : 109
% 1.18/0.65 # Propositional unsat checks : 0
% 1.18/0.65 # Propositional check models : 0
% 1.18/0.65 # Propositional check unsatisfiable : 0
% 1.18/0.65 # Propositional clauses : 0
% 1.18/0.65 # Propositional clauses after purity: 0
% 1.18/0.65 # Propositional unsat core size : 0
% 1.18/0.65 # Propositional preprocessing time : 0.000
% 1.18/0.65 # Propositional encoding time : 0.000
% 1.18/0.65 # Propositional solver time : 0.000
% 1.18/0.65 # Success case prop preproc time : 0.000
% 1.18/0.65 # Success case prop encoding time : 0.000
% 1.18/0.65 # Success case prop solver time : 0.000
% 1.18/0.65 # Current number of processed clauses : 108
% 1.18/0.65 # Positive orientable unit clauses : 4
% 1.18/0.65 # Positive unorientable unit clauses: 13
% 1.18/0.65 # Negative unit clauses : 24
% 1.18/0.65 # Non-unit-clauses : 67
% 1.18/0.65 # Current number of unprocessed clauses: 9386
% 1.18/0.65 # ...number of literals in the above : 16873
% 1.18/0.65 # Current number of archived formulas : 0
% 1.18/0.65 # Current number of archived clauses : 20
% 1.18/0.65 # Clause-clause subsumption calls (NU) : 2277
% 1.18/0.65 # Rec. Clause-clause subsumption calls : 2277
% 1.18/0.65 # Non-unit clause-clause subsumptions : 424
% 1.18/0.65 # Unit Clause-clause subsumption calls : 62
% 1.18/0.65 # Rewrite failures with RHS unbound : 0
% 1.18/0.65 # BW rewrite match attempts : 1817
% 1.18/0.65 # BW rewrite match successes : 686
% 1.18/0.65 # Condensation attempts : 0
% 1.18/0.65 # Condensation successes : 0
% 1.18/0.65 # Termbank termtop insertions : 145279
% 1.18/0.65 # Search garbage collected termcells : 35
% 1.18/0.65
% 1.18/0.65 # -------------------------------------------------
% 1.18/0.65 # User time : 0.113 s
% 1.18/0.65 # System time : 0.009 s
% 1.18/0.65 # Total time : 0.122 s
% 1.18/0.65 # Maximum resident set size: 1636 pages
% 1.18/0.65
% 1.18/0.65 # -------------------------------------------------
% 1.18/0.65 # User time : 0.579 s
% 1.18/0.65 # System time : 0.021 s
% 1.18/0.65 # Total time : 0.599 s
% 1.18/0.65 # Maximum resident set size: 1704 pages
% 1.18/0.65 % E---3.1 exiting
% 1.18/0.65 % E exiting
%------------------------------------------------------------------------------