TSTP Solution File: SWV262-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV262-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 05:22:04 EDT 2024
% Result : Unsatisfiable 0.66s 0.72s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 8 RR)
% Number of literals : 29 ( 28 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 36 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_List_Oset__empty2_1,axiom,
c_emptyset = c_List_Oset(c_List_Olist_ONil,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_List_Oset__empty2_1) ).
cnf(cls_SetInterval_OlessThan__0_0,axiom,
c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OlessThan__0_0) ).
cnf(cls_List_Oset__empty_1,axiom,
c_List_Oset(c_List_Olist_ONil,X1) = c_emptyset,
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_List_Oset__empty_1) ).
cnf(cls_Set_OCompl__UNIV__eq_0,axiom,
c_uminus(c_UNIV,tc_set(X1)) = c_emptyset,
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OCompl__UNIV__eq_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_ODiff__cancel_0,axiom,
c_minus(X1,X1,tc_set(X2)) = c_emptyset,
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__cancel_0) ).
cnf(cls_Message_Oparts__insert_0,axiom,
c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(X2),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__insert_0) ).
cnf(cls_Datatype_Oo2s_Osimps__2_0,axiom,
c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2) = c_insert(X1,c_emptyset,X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Datatype_Oo2s_Osimps__2_0) ).
cnf(cls_Set_OUn__assoc_0,axiom,
c_union(c_union(X1,X2,X3),X4,X3) = c_union(X1,c_union(X2,X4,X3),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__assoc_0) ).
cnf(c_0_9,axiom,
c_emptyset = c_List_Oset(c_List_Olist_ONil,X1),
cls_List_Oset__empty2_1 ).
cnf(c_0_10,axiom,
c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
cls_SetInterval_OlessThan__0_0 ).
cnf(c_0_11,axiom,
c_List_Oset(c_List_Olist_ONil,X1) = c_emptyset,
cls_List_Oset__empty_1 ).
cnf(c_0_12,plain,
c_SetInterval_OlessThan(c_0,tc_nat) = c_List_Oset(c_List_Olist_ONil,X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
c_uminus(c_UNIV,tc_set(X1)) = c_emptyset,
cls_Set_OCompl__UNIV__eq_0 ).
cnf(c_0_14,plain,
c_List_Oset(c_List_Olist_ONil,X1) = c_List_Oset(c_List_Olist_ONil,c_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_15,plain,
c_uminus(c_UNIV,tc_set(X1)) = c_List_Oset(c_List_Olist_ONil,c_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_17,axiom,
c_minus(X1,X1,tc_set(X2)) = c_emptyset,
cls_Set_ODiff__cancel_0 ).
cnf(c_0_18,plain,
c_List_Oset(c_List_Olist_ONil,X1) = c_uminus(c_UNIV,tc_set(c_0)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
c_0_16 ).
cnf(c_0_20,axiom,
c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(c_insert(X1,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(X2),tc_Message_Omsg),
cls_Message_Oparts__insert_0 ).
cnf(c_0_21,plain,
c_minus(X1,X1,tc_set(X2)) = c_uminus(c_UNIV,tc_set(c_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10]),c_0_12]),c_0_18]) ).
cnf(c_0_22,axiom,
c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2) = c_insert(X1,c_emptyset,X2),
cls_Datatype_Oo2s_Osimps__2_0 ).
cnf(c_0_23,negated_conjecture,
c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_SetInterval_OlessThan(c_0,tc_nat),tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_SetInterval_OlessThan(c_0,tc_nat),tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_10]),c_0_10]) ).
cnf(c_0_24,plain,
c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)) = c_union(c_Message_Oparts(c_insert(X1,c_minus(c_0,c_0,tc_set(c_0)),tc_Message_Omsg)),c_Message_Oparts(X2),tc_Message_Omsg),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_10]),c_0_12]),c_0_18]),c_0_21]) ).
cnf(c_0_25,plain,
c_insert(X1,c_minus(c_0,c_0,tc_set(c_0)),X2) = c_Datatype_Oo2s(c_Datatype_Ooption_OSome(X1,X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_10]),c_0_12]),c_0_18]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
c_union(c_union(c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_X,tc_Message_Omsg),tc_Message_Omsg)),c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_Y,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg) != c_union(c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_X,tc_Message_Omsg),tc_Message_Omsg)),c_union(c_Message_Oparts(c_Datatype_Oo2s(c_Datatype_Ooption_OSome(v_Y,tc_Message_Omsg),tc_Message_Omsg)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_Message_Omsg),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_12]),c_0_18]),c_0_21]),c_0_12]),c_0_18]),c_0_21]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_27,axiom,
c_union(c_union(X1,X2,X3),X4,X3) = c_union(X1,c_union(X2,X4,X3),X3),
cls_Set_OUn__assoc_0 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV262-1 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n005.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 : Sun May 19 07:54:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 0.66/0.72 # Version: 3.1.0
% 0.66/0.72 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.66/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.66/0.72 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.72 # Starting new_bool_1 with 300s (1) cores
% 0.66/0.72 # Starting sh5l with 300s (1) cores
% 0.66/0.72 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1699 completed with status 0
% 0.66/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.66/0.72 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.66/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.66/0.72 # No SInE strategy applied
% 0.66/0.72 # Search class: FGHSM-SMLM32-DFFFFFNN
% 0.66/0.72 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 0.66/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.66/0.72 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 0.66/0.72 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.66/0.72 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 0.66/0.72 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1710 completed with status 0
% 0.66/0.72 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.66/0.72 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.66/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.66/0.72 # No SInE strategy applied
% 0.66/0.72 # Search class: FGHSM-SMLM32-DFFFFFNN
% 0.66/0.72 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 0.66/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.66/0.72 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 0.66/0.72 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.66/0.72 # Preprocessing time : 0.027 s
% 0.66/0.72 # Presaturation interreduction done
% 0.66/0.72
% 0.66/0.72 # Proof found!
% 0.66/0.72 # SZS status Unsatisfiable
% 0.66/0.72 # SZS output start CNFRefutation
% See solution above
% 0.66/0.72 # Parsed axioms : 2775
% 0.66/0.72 # Removed by relevancy pruning/SinE : 0
% 0.66/0.72 # Initial clauses : 2775
% 0.66/0.72 # Removed in clause preprocessing : 9
% 0.66/0.72 # Initial clauses in saturation : 2766
% 0.66/0.72 # Processed clauses : 1896
% 0.66/0.72 # ...of these trivial : 20
% 0.66/0.72 # ...subsumed : 56
% 0.66/0.72 # ...remaining for further processing : 1820
% 0.66/0.72 # Other redundant clauses eliminated : 0
% 0.66/0.72 # Clauses deleted for lack of memory : 0
% 0.66/0.72 # Backward-subsumed : 3
% 0.66/0.72 # Backward-rewritten : 133
% 0.66/0.72 # Generated clauses : 0
% 0.66/0.72 # ...of the previous two non-redundant : 122
% 0.66/0.72 # ...aggressively subsumed : 0
% 0.66/0.72 # Contextual simplify-reflections : 0
% 0.66/0.72 # Paramodulations : 0
% 0.66/0.72 # Factorizations : 0
% 0.66/0.72 # NegExts : 0
% 0.66/0.72 # Equation resolutions : 0
% 0.66/0.72 # Disequality decompositions : 0
% 0.66/0.72 # Total rewrite steps : 553
% 0.66/0.72 # ...of those cached : 485
% 0.66/0.72 # Propositional unsat checks : 0
% 0.66/0.72 # Propositional check models : 0
% 0.66/0.72 # Propositional check unsatisfiable : 0
% 0.66/0.72 # Propositional clauses : 0
% 0.66/0.72 # Propositional clauses after purity: 0
% 0.66/0.72 # Propositional unsat core size : 0
% 0.66/0.72 # Propositional preprocessing time : 0.000
% 0.66/0.72 # Propositional encoding time : 0.000
% 0.66/0.72 # Propositional solver time : 0.000
% 0.66/0.72 # Success case prop preproc time : 0.000
% 0.66/0.72 # Success case prop encoding time : 0.000
% 0.66/0.72 # Success case prop solver time : 0.000
% 0.66/0.72 # Current number of processed clauses : 1684
% 0.66/0.72 # Positive orientable unit clauses : 382
% 0.66/0.72 # Positive unorientable unit clauses: 8
% 0.66/0.72 # Negative unit clauses : 32
% 0.66/0.72 # Non-unit-clauses : 1262
% 0.66/0.72 # Current number of unprocessed clauses: 992
% 0.66/0.72 # ...number of literals in the above : 2813
% 0.66/0.72 # Current number of archived formulas : 0
% 0.66/0.72 # Current number of archived clauses : 144
% 0.66/0.72 # Clause-clause subsumption calls (NU) : 557063
% 0.66/0.72 # Rec. Clause-clause subsumption calls : 491642
% 0.66/0.72 # Non-unit clause-clause subsumptions : 38
% 0.66/0.72 # Unit Clause-clause subsumption calls : 31035
% 0.66/0.72 # Rewrite failures with RHS unbound : 0
% 0.66/0.72 # BW rewrite match attempts : 156
% 0.66/0.72 # BW rewrite match successes : 37
% 0.66/0.72 # Condensation attempts : 0
% 0.66/0.72 # Condensation successes : 0
% 0.66/0.72 # Termbank termtop insertions : 73471
% 0.66/0.72 # Search garbage collected termcells : 4018
% 0.66/0.72
% 0.66/0.72 # -------------------------------------------------
% 0.66/0.72 # User time : 0.165 s
% 0.66/0.72 # System time : 0.017 s
% 0.66/0.72 # Total time : 0.182 s
% 0.66/0.72 # Maximum resident set size: 6740 pages
% 0.66/0.72
% 0.66/0.72 # -------------------------------------------------
% 0.66/0.72 # User time : 0.667 s
% 0.66/0.72 # System time : 0.062 s
% 0.66/0.72 # Total time : 0.729 s
% 0.66/0.72 # Maximum resident set size: 3480 pages
% 0.66/0.72 % E---3.1 exiting
% 0.66/0.72 % E exiting
%------------------------------------------------------------------------------