TSTP Solution File: SWW407-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW407-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:42:39 EDT 2024
% Result : Unsatisfiable 8.10s 1.48s
% Output : CNFRefutation 8.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 18 unt; 6 nHn; 23 RR)
% Number of literals : 46 ( 15 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 70 ( 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/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
cnf(unfolding_4,axiom,
( heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_4) ).
cnf(premise_9,hypothesis,
heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_9) ).
cnf(premise_5,hypothesis,
x1 != x2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_5) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.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,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
c_0_7 ).
cnf(c_0_9,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_10,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_11,plain,
( heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))) ),
inference(fof_simplification,[status(thm)],[unfolding_4]) ).
cnf(c_0_12,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),X3))
| ~ heap(sep(next(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_14,plain,
( heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))) ),
c_0_11 ).
cnf(c_0_15,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),sep(X3,X4)))
| ~ heap(sep(X3,sep(next(X1,X2),X4))) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X2,sep(X1,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,hypothesis,
heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
premise_9 ).
cnf(c_0_18,hypothesis,
x1 != x2,
inference(fof_simplification,[status(thm)],[premise_5]) ).
cnf(c_0_19,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
inference(fof_simplification,[status(thm)],[conclusion_1]) ).
cnf(c_0_20,plain,
( heap(sep(lseg(X1,X2),sep(X3,sep(next(X2,X4),X5))))
| ~ heap(sep(lseg(X1,X6),sep(lseg(X6,X2),sep(X3,sep(next(X2,X4),X5))))) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_21,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),sep(X3,sep(X4,sep(X5,X6)))))
| ~ heap(sep(X3,sep(X5,sep(X4,sep(next(X1,X2),X6))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,hypothesis,
heap(sep(lseg(x4,nil),sep(lseg(x3,x1),sep(next(x2,x4),sep(next(x1,x2),emp))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_23,hypothesis,
x1 != x2,
c_0_18 ).
cnf(c_0_24,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
c_0_19 ).
cnf(c_0_25,plain,
( heap(sep(lseg(X1,X2),sep(X3,sep(next(X2,X4),X5))))
| ~ heap(sep(X3,sep(lseg(X6,X2),sep(lseg(X1,X6),sep(next(X2,X4),X5))))) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,hypothesis,
heap(sep(lseg(x4,nil),sep(lseg(x1,x2),sep(lseg(x3,x1),sep(next(x2,x4),emp))))),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10]),c_0_23]),c_0_10]) ).
cnf(c_0_27,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(lseg(x3,x2),sep(next(x2,x4),emp)))),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_10]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SWW407-1 : TPTP v8.2.0. Released v5.2.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.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 20:24:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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/benchmark/theBenchmark.p
% 8.10/1.48 # Version: 3.1.0
% 8.10/1.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.10/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.10/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.10/1.48 # Starting new_bool_3 with 300s (1) cores
% 8.10/1.48 # Starting new_bool_1 with 300s (1) cores
% 8.10/1.48 # Starting sh5l with 300s (1) cores
% 8.10/1.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28601 completed with status 0
% 8.10/1.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.10/1.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.10/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.10/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.10/1.48 # No SInE strategy applied
% 8.10/1.48 # Search class: FGUSS-FFMF22-MFFFFFNN
% 8.10/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.10/1.48 # Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 8.10/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.10/1.48 # Starting new_bool_3 with 203s (1) cores
% 8.10/1.48 # Starting new_bool_1 with 203s (1) cores
% 8.10/1.48 # Starting sh5l with 203s (1) cores
% 8.10/1.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28606 completed with status 0
% 8.10/1.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.10/1.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.10/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.10/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.10/1.48 # No SInE strategy applied
% 8.10/1.48 # Search class: FGUSS-FFMF22-MFFFFFNN
% 8.10/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.10/1.48 # Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 8.10/1.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.10/1.48 # Preprocessing time : 0.001 s
% 8.10/1.48 # Presaturation interreduction done
% 8.10/1.48
% 8.10/1.48 # Proof found!
% 8.10/1.48 # SZS status Unsatisfiable
% 8.10/1.48 # SZS output start CNFRefutation
% See solution above
% 8.10/1.48 # Parsed axioms : 21
% 8.10/1.48 # Removed by relevancy pruning/SinE : 0
% 8.10/1.48 # Initial clauses : 21
% 8.10/1.48 # Removed in clause preprocessing : 0
% 8.10/1.48 # Initial clauses in saturation : 21
% 8.10/1.48 # Processed clauses : 5985
% 8.10/1.48 # ...of these trivial : 34
% 8.10/1.48 # ...subsumed : 5658
% 8.10/1.48 # ...remaining for further processing : 292
% 8.10/1.48 # Other redundant clauses eliminated : 0
% 8.10/1.48 # Clauses deleted for lack of memory : 0
% 8.10/1.48 # Backward-subsumed : 2
% 8.10/1.48 # Backward-rewritten : 1
% 8.10/1.48 # Generated clauses : 43598
% 8.10/1.48 # ...of the previous two non-redundant : 43435
% 8.10/1.48 # ...aggressively subsumed : 0
% 8.10/1.48 # Contextual simplify-reflections : 0
% 8.10/1.48 # Paramodulations : 43598
% 8.10/1.48 # Factorizations : 0
% 8.10/1.48 # NegExts : 0
% 8.10/1.48 # Equation resolutions : 0
% 8.10/1.48 # Disequality decompositions : 0
% 8.10/1.48 # Total rewrite steps : 787
% 8.10/1.48 # ...of those cached : 628
% 8.10/1.48 # Propositional unsat checks : 0
% 8.10/1.48 # Propositional check models : 0
% 8.10/1.48 # Propositional check unsatisfiable : 0
% 8.10/1.48 # Propositional clauses : 0
% 8.10/1.48 # Propositional clauses after purity: 0
% 8.10/1.48 # Propositional unsat core size : 0
% 8.10/1.48 # Propositional preprocessing time : 0.000
% 8.10/1.48 # Propositional encoding time : 0.000
% 8.10/1.48 # Propositional solver time : 0.000
% 8.10/1.48 # Success case prop preproc time : 0.000
% 8.10/1.48 # Success case prop encoding time : 0.000
% 8.10/1.48 # Success case prop solver time : 0.000
% 8.10/1.48 # Current number of processed clauses : 268
% 8.10/1.48 # Positive orientable unit clauses : 10
% 8.10/1.48 # Positive unorientable unit clauses: 19
% 8.10/1.48 # Negative unit clauses : 37
% 8.10/1.48 # Non-unit-clauses : 202
% 8.10/1.48 # Current number of unprocessed clauses: 37483
% 8.10/1.48 # ...number of literals in the above : 77112
% 8.10/1.48 # Current number of archived formulas : 0
% 8.10/1.48 # Current number of archived clauses : 24
% 8.10/1.48 # Clause-clause subsumption calls (NU) : 36312
% 8.10/1.48 # Rec. Clause-clause subsumption calls : 36312
% 8.10/1.48 # Non-unit clause-clause subsumptions : 2860
% 8.10/1.48 # Unit Clause-clause subsumption calls : 157
% 8.10/1.48 # Rewrite failures with RHS unbound : 0
% 8.10/1.48 # BW rewrite match attempts : 4450
% 8.10/1.48 # BW rewrite match successes : 1504
% 8.10/1.48 # Condensation attempts : 0
% 8.10/1.48 # Condensation successes : 0
% 8.10/1.48 # Termbank termtop insertions : 708414
% 8.10/1.48 # Search garbage collected termcells : 43
% 8.10/1.48
% 8.10/1.48 # -------------------------------------------------
% 8.10/1.48 # User time : 0.955 s
% 8.10/1.48 # System time : 0.024 s
% 8.10/1.48 # Total time : 0.979 s
% 8.10/1.48 # Maximum resident set size: 1660 pages
% 8.10/1.48
% 8.10/1.48 # -------------------------------------------------
% 8.10/1.48 # User time : 4.823 s
% 8.10/1.48 # System time : 0.052 s
% 8.10/1.48 # Total time : 4.875 s
% 8.10/1.48 # Maximum resident set size: 1716 pages
% 8.10/1.48 % E---3.1 exiting
% 8.10/1.49 % E exiting
%------------------------------------------------------------------------------