TSTP Solution File: SWV241-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV241-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 09:43:16 EDT 2024
% Result : Unsatisfiable 114.98s 15.21s
% Output : CNFRefutation 114.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 9 unt; 9 nHn; 25 RR)
% Number of literals : 62 ( 6 equ; 25 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oanalz__trans_0,axiom,
( c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_lessequals(X2,c_Message_Oanalz(X3),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_Message_Oanalz__trans_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_Set_OsubsetI_0) ).
cnf(cls_Message_Oanalz_OInj_0,axiom,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_Message_Oanalz_OInj_0) ).
cnf(cls_Set_OinsertE_0,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_Set_OinsertE_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_Y,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_conjecture_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_X,c_Message_Oanalz(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p',cls_conjecture_1) ).
cnf(c_0_8,plain,
( c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_lessequals(X2,c_Message_Oanalz(X3),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__trans_0]) ).
cnf(c_0_9,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_10,plain,
( c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_lessequals(X2,c_Message_Oanalz(X3),tc_set(tc_Message_Omsg)) ),
c_0_8 ).
cnf(c_0_11,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_12,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_9 ).
cnf(c_0_13,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_OInj_0]) ).
cnf(c_0_14,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_15,plain,
( c_in(c_Main_OsubsetI__1(X1,c_Message_Oanalz(X2),tc_Message_Omsg),X1,tc_Message_Omsg)
| c_in(X3,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X3,c_Message_Oanalz(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
c_in(v_Y,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_17,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(c_Main_OsubsetI__1(X3,c_Message_Oanalz(X2),tc_Message_Omsg),c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
c_0_13 ).
cnf(c_0_19,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg)
| c_in(v_Y,c_Message_Oanalz(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_22,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(c_Main_OsubsetI__1(X3,c_Message_Oanalz(X2),tc_Message_Omsg),X2,tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg) = v_X
| c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(X1),tc_Message_Omsg),v_H,tc_Message_Omsg)
| c_in(v_Y,c_Message_Oanalz(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
( c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_Message_Omsg) = v_X
| c_in(X1,c_Message_Oanalz(v_H),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_Message_Omsg) = v_X,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
c_in(v_X,c_Message_Oanalz(v_H),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_28,negated_conjecture,
( c_in(X1,c_Message_Oanalz(v_H),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_16]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.18 % Problem : SWV241-1 : TPTP v8.1.2. Released v3.2.0.
% 0.17/0.19 % Command : run_E %s %d THM
% 0.19/0.39 % Computer : n015.cluster.edu
% 0.19/0.39 % Model : x86_64 x86_64
% 0.19/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.39 % Memory : 8042.1875MB
% 0.19/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.39 % CPULimit : 300
% 0.19/0.39 % WCLimit : 300
% 0.19/0.39 % DateTime : Fri May 3 17:04:23 EDT 2024
% 0.19/0.39 % CPUTime :
% 0.38/0.60 Running first-order theorem proving
% 0.38/0.60 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.xRphd83LvO/E---3.1_20871.p
% 114.98/15.21 # Version: 3.1.0
% 114.98/15.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 114.98/15.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 114.98/15.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 114.98/15.21 # Starting new_bool_3 with 300s (1) cores
% 114.98/15.21 # Starting new_bool_1 with 300s (1) cores
% 114.98/15.21 # Starting sh5l with 300s (1) cores
% 114.98/15.21 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20949 completed with status 0
% 114.98/15.21 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 114.98/15.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 114.98/15.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 114.98/15.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 114.98/15.21 # No SInE strategy applied
% 114.98/15.21 # Search class: FGHSM-SSLM32-MFFFFFNN
% 114.98/15.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 114.98/15.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 114.98/15.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 114.98/15.21 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 114.98/15.21 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 114.98/15.21 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 114.98/15.21 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 20956 completed with status 0
% 114.98/15.21 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 114.98/15.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 114.98/15.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 114.98/15.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 114.98/15.21 # No SInE strategy applied
% 114.98/15.21 # Search class: FGHSM-SSLM32-MFFFFFNN
% 114.98/15.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 114.98/15.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 114.98/15.21 # Preprocessing time : 0.009 s
% 114.98/15.21 # Presaturation interreduction done
% 114.98/15.21
% 114.98/15.21 # Proof found!
% 114.98/15.21 # SZS status Unsatisfiable
% 114.98/15.21 # SZS output start CNFRefutation
% See solution above
% 114.98/15.21 # Parsed axioms : 1389
% 114.98/15.21 # Removed by relevancy pruning/SinE : 0
% 114.98/15.21 # Initial clauses : 1389
% 114.98/15.21 # Removed in clause preprocessing : 1
% 114.98/15.21 # Initial clauses in saturation : 1388
% 114.98/15.21 # Processed clauses : 107716
% 114.98/15.21 # ...of these trivial : 14988
% 114.98/15.21 # ...subsumed : 83222
% 114.98/15.21 # ...remaining for further processing : 9506
% 114.98/15.21 # Other redundant clauses eliminated : 4
% 114.98/15.21 # Clauses deleted for lack of memory : 0
% 114.98/15.21 # Backward-subsumed : 101
% 114.98/15.21 # Backward-rewritten : 570
% 114.98/15.21 # Generated clauses : 900073
% 114.98/15.21 # ...of the previous two non-redundant : 717258
% 114.98/15.21 # ...aggressively subsumed : 0
% 114.98/15.21 # Contextual simplify-reflections : 2
% 114.98/15.21 # Paramodulations : 899981
% 114.98/15.21 # Factorizations : 40
% 114.98/15.21 # NegExts : 0
% 114.98/15.21 # Equation resolutions : 52
% 114.98/15.21 # Disequality decompositions : 0
% 114.98/15.21 # Total rewrite steps : 2951583
% 114.98/15.21 # ...of those cached : 2937118
% 114.98/15.21 # Propositional unsat checks : 1
% 114.98/15.21 # Propositional check models : 0
% 114.98/15.21 # Propositional check unsatisfiable : 0
% 114.98/15.21 # Propositional clauses : 0
% 114.98/15.21 # Propositional clauses after purity: 0
% 114.98/15.21 # Propositional unsat core size : 0
% 114.98/15.21 # Propositional preprocessing time : 0.000
% 114.98/15.21 # Propositional encoding time : 0.071
% 114.98/15.21 # Propositional solver time : 0.071
% 114.98/15.21 # Success case prop preproc time : 0.000
% 114.98/15.21 # Success case prop encoding time : 0.000
% 114.98/15.21 # Success case prop solver time : 0.000
% 114.98/15.21 # Current number of processed clauses : 7486
% 114.98/15.21 # Positive orientable unit clauses : 1441
% 114.98/15.21 # Positive unorientable unit clauses: 0
% 114.98/15.21 # Negative unit clauses : 1918
% 114.98/15.21 # Non-unit-clauses : 4127
% 114.98/15.21 # Current number of unprocessed clauses: 593649
% 114.98/15.21 # ...number of literals in the above : 1029838
% 114.98/15.21 # Current number of archived formulas : 0
% 114.98/15.21 # Current number of archived clauses : 2020
% 114.98/15.21 # Clause-clause subsumption calls (NU) : 5110017
% 114.98/15.21 # Rec. Clause-clause subsumption calls : 4806239
% 114.98/15.21 # Non-unit clause-clause subsumptions : 6585
% 114.98/15.21 # Unit Clause-clause subsumption calls : 709893
% 114.98/15.21 # Rewrite failures with RHS unbound : 0
% 114.98/15.21 # BW rewrite match attempts : 46801
% 114.98/15.21 # BW rewrite match successes : 452
% 114.98/15.21 # Condensation attempts : 0
% 114.98/15.21 # Condensation successes : 0
% 114.98/15.21 # Termbank termtop insertions : 23661274
% 114.98/15.21 # Search garbage collected termcells : 1664
% 114.98/15.21
% 114.98/15.21 # -------------------------------------------------
% 114.98/15.22 # User time : 13.758 s
% 114.98/15.22 # System time : 0.487 s
% 114.98/15.22 # Total time : 14.245 s
% 114.98/15.22 # Maximum resident set size: 3956 pages
% 114.98/15.22
% 114.98/15.22 # -------------------------------------------------
% 114.98/15.22 # User time : 69.106 s
% 114.98/15.22 # System time : 2.102 s
% 114.98/15.22 # Total time : 71.208 s
% 114.98/15.22 # Maximum resident set size: 2436 pages
% 114.98/15.22 % E---3.1 exiting
% 114.98/15.22 % E exiting
%------------------------------------------------------------------------------