TSTP Solution File: SWW423-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW423-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n017.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:30 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 12 unt; 4 nHn; 13 RR)
% Number of literals : 24 ( 10 equ; 10 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 : 27 ( 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.bSrLH6BX3z/E---3.1_28686.p',unfolding_2) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.bSrLH6BX3z/E---3.1_28686.p',associative_commutative) ).
cnf(premise_2,hypothesis,
x2 != x1,
file('/export/starexec/sandbox2/tmp/tmp.bSrLH6BX3z/E---3.1_28686.p',premise_2) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))),
file('/export/starexec/sandbox2/tmp/tmp.bSrLH6BX3z/E---3.1_28686.p',conclusion_1) ).
cnf(premise_4,hypothesis,
heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp)))),
file('/export/starexec/sandbox2/tmp/tmp.bSrLH6BX3z/E---3.1_28686.p',premise_4) ).
cnf(c_0_5,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_6,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_7,plain,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
c_0_5 ).
cnf(c_0_8,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_9,hypothesis,
x2 != x1,
inference(fof_simplification,[status(thm)],[premise_2]) ).
cnf(c_0_10,negated_conjecture,
~ heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))),
inference(fof_simplification,[status(thm)],[conclusion_1]) ).
cnf(c_0_11,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_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp)))),
premise_4 ).
cnf(c_0_13,hypothesis,
x2 != x1,
c_0_9 ).
cnf(c_0_14,negated_conjecture,
~ heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))),
c_0_10 ).
cnf(c_0_15,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW423-1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 07:13:09 EDT 2024
% 0.19/0.34 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.bSrLH6BX3z/E---3.1_28686.p
% 0.21/0.53 # Version: 3.2.0
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28766 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGUSS-FFSF22-MFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 226s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 226s (1) cores
% 0.21/0.53 # Starting sh5l with 226s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28774 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGUSS-FFSF22-MFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 16
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 16
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 16
% 0.21/0.53 # Processed clauses : 501
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 423
% 0.21/0.53 # ...remaining for further processing : 77
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 1183
% 0.21/0.53 # ...of the previous two non-redundant : 1149
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 1183
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 27
% 0.21/0.53 # ...of those cached : 10
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 61
% 0.21/0.53 # Positive orientable unit clauses : 2
% 0.21/0.53 # Positive unorientable unit clauses: 3
% 0.21/0.53 # Negative unit clauses : 18
% 0.21/0.53 # Non-unit-clauses : 38
% 0.21/0.53 # Current number of unprocessed clauses: 660
% 0.21/0.53 # ...number of literals in the above : 1326
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 16
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 818
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 818
% 0.21/0.53 # Non-unit clause-clause subsumptions : 170
% 0.21/0.53 # Unit Clause-clause subsumption calls : 10
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 87
% 0.21/0.53 # BW rewrite match successes : 82
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 14247
% 0.21/0.53 # Search garbage collected termcells : 33
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.024 s
% 0.21/0.53 # System time : 0.004 s
% 0.21/0.53 # Total time : 0.028 s
% 0.21/0.53 # Maximum resident set size: 1660 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.126 s
% 0.21/0.53 # System time : 0.011 s
% 0.21/0.53 # Total time : 0.138 s
% 0.21/0.53 # Maximum resident set size: 1704 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------