TSTP Solution File: SWW417-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW417-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:03 EDT 2024
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 11 unt; 4 nHn; 13 RR)
% Number of literals : 23 ( 9 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 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/tmp/tmp.62wENwQgeO/E---3.1_22249.p',unfolding_2) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.62wENwQgeO/E---3.1_22249.p',associative_commutative) ).
cnf(premise_2,hypothesis,
x2 != x1,
file('/export/starexec/sandbox/tmp/tmp.62wENwQgeO/E---3.1_22249.p',premise_2) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x1,nil),emp)),
file('/export/starexec/sandbox/tmp/tmp.62wENwQgeO/E---3.1_22249.p',conclusion_1) ).
cnf(premise_3,hypothesis,
heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
file('/export/starexec/sandbox/tmp/tmp.62wENwQgeO/E---3.1_22249.p',premise_3) ).
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,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_7,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_8,hypothesis,
x2 != x1,
inference(fof_simplification,[status(thm)],[premise_2]) ).
cnf(c_0_9,negated_conjecture,
~ heap(sep(lseg(x1,nil),emp)),
inference(fof_simplification,[status(thm)],[conclusion_1]) ).
cnf(c_0_10,plain,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(lseg(X2,X3),sep(next(X1,X2),X4))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,hypothesis,
heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
premise_3 ).
cnf(c_0_12,hypothesis,
x2 != x1,
c_0_8 ).
cnf(c_0_13,negated_conjecture,
~ heap(sep(lseg(x1,nil),emp)),
c_0_9 ).
cnf(c_0_14,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SWW417-1 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.17 % Command : run_E %s %d THM
% 0.12/0.37 % Computer : n028.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8042.1875MB
% 0.12/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri May 3 13:18:18 EDT 2024
% 0.12/0.37 % CPUTime :
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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/tmp/tmp.62wENwQgeO/E---3.1_22249.p
% 0.19/0.52 # Version: 3.1.0
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # sh5l with pid 22330 completed with status 0
% 0.19/0.52 # Result found by sh5l
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.52 # Search class: FGUSS-FFSF22-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 22333 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.52 # Search class: FGUSS-FFSF22-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 15
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 15
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 15
% 0.19/0.52 # Processed clauses : 237
% 0.19/0.52 # ...of these trivial : 0
% 0.19/0.52 # ...subsumed : 184
% 0.19/0.52 # ...remaining for further processing : 53
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 0
% 0.19/0.52 # Backward-rewritten : 0
% 0.19/0.52 # Generated clauses : 428
% 0.19/0.52 # ...of the previous two non-redundant : 408
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 428
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Disequality decompositions : 0
% 0.19/0.52 # Total rewrite steps : 14
% 0.19/0.52 # ...of those cached : 2
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 38
% 0.19/0.52 # Positive orientable unit clauses : 2
% 0.19/0.52 # Positive unorientable unit clauses: 2
% 0.19/0.52 # Negative unit clauses : 14
% 0.19/0.52 # Non-unit-clauses : 20
% 0.19/0.52 # Current number of unprocessed clauses: 192
% 0.19/0.52 # ...number of literals in the above : 379
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 15
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 240
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 240
% 0.19/0.52 # Non-unit clause-clause subsumptions : 58
% 0.19/0.52 # Unit Clause-clause subsumption calls : 7
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 50
% 0.19/0.52 # BW rewrite match successes : 48
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 5057
% 0.19/0.52 # Search garbage collected termcells : 31
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.010 s
% 0.19/0.52 # System time : 0.002 s
% 0.19/0.52 # Total time : 0.012 s
% 0.19/0.52 # Maximum resident set size: 1592 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.012 s
% 0.19/0.52 # System time : 0.004 s
% 0.19/0.52 # Total time : 0.015 s
% 0.19/0.52 # Maximum resident set size: 1704 pages
% 0.19/0.52 % E---3.1 exiting
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------