TSTP Solution File: SWV260-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV260-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:56:33 EDT 2023
% Result : Unsatisfiable 32.35s 4.54s
% Output : CNFRefutation 32.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 9 unt; 9 nHn; 22 RR)
% Number of literals : 66 ( 6 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 76 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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.q0lTxkntmt/E---3.1_4177.p',cls_Set_OsubsetI_1) ).
cnf(cls_Message_Oparts_OInj_0,axiom,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_Message_Oparts_OInj_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_Set_OUnCI_0) ).
cnf(cls_Set_OUnCI_1,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_Set_OUnCI_1) ).
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.q0lTxkntmt/E---3.1_4177.p',cls_Set_OinsertE_0) ).
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.q0lTxkntmt/E---3.1_4177.p',cls_Set_OsubsetI_0) ).
cnf(cls_Message_Oparts__trans_0,axiom,
( c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_lessequals(X2,c_Message_Oparts(X3),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_Message_Oparts__trans_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_Y,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.q0lTxkntmt/E---3.1_4177.p',cls_conjecture_2) ).
cnf(c_0_10,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
cls_Set_OsubsetI_1 ).
cnf(c_0_11,axiom,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
cls_Message_Oparts_OInj_0 ).
cnf(c_0_12,plain,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(X2),tc_Message_Omsg),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUnCI_0 ).
cnf(c_0_14,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUnCI_1 ).
cnf(c_0_15,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_16,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_17,plain,
( c_lessequals(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),X3,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( c_lessequals(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_19,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1
| c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
( c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_lessequals(X2,c_Message_Oparts(X3),tc_set(tc_Message_Omsg)) ),
cls_Message_Oparts__trans_0 ).
cnf(c_0_21,plain,
c_lessequals(X1,c_Message_Oparts(c_union(X2,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) = X1
| c_lessequals(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( c_in(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,tc_Message_Omsg),c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) = X1
| c_in(X4,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(X4,c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
c_in(v_Y,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_26,plain,
( c_lessequals(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oparts(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg) = v_X
| c_in(v_Y,c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( c_lessequals(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| c_in(v_Y,c_Message_Oparts(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(v_X,c_Message_Oparts(X1),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_30,negated_conjecture,
~ c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_2 ).
cnf(c_0_31,negated_conjecture,
c_lessequals(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( c_in(X1,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV260-2 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 03:48:10 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.q0lTxkntmt/E---3.1_4177.p
% 32.35/4.54 # Version: 3.1pre001
% 32.35/4.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 32.35/4.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.35/4.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.35/4.54 # Starting new_bool_3 with 300s (1) cores
% 32.35/4.54 # Starting new_bool_1 with 300s (1) cores
% 32.35/4.54 # Starting sh5l with 300s (1) cores
% 32.35/4.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4264 completed with status 0
% 32.35/4.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 32.35/4.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 32.35/4.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.35/4.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.35/4.54 # No SInE strategy applied
% 32.35/4.54 # Search class: FGUSF-FFSF32-SFFFFFNN
% 32.35/4.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 32.35/4.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 32.35/4.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 32.35/4.54 # Starting new_bool_3 with 136s (1) cores
% 32.35/4.54 # Starting new_bool_1 with 136s (1) cores
% 32.35/4.54 # Starting sh5l with 136s (1) cores
% 32.35/4.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4270 completed with status 0
% 32.35/4.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 32.35/4.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 32.35/4.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.35/4.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.35/4.54 # No SInE strategy applied
% 32.35/4.54 # Search class: FGUSF-FFSF32-SFFFFFNN
% 32.35/4.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 32.35/4.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 32.35/4.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 32.35/4.54 # Preprocessing time : 0.001 s
% 32.35/4.54 # Presaturation interreduction done
% 32.35/4.54
% 32.35/4.54 # Proof found!
% 32.35/4.54 # SZS status Unsatisfiable
% 32.35/4.54 # SZS output start CNFRefutation
% See solution above
% 32.35/4.54 # Parsed axioms : 10
% 32.35/4.54 # Removed by relevancy pruning/SinE : 0
% 32.35/4.54 # Initial clauses : 10
% 32.35/4.54 # Removed in clause preprocessing : 0
% 32.35/4.54 # Initial clauses in saturation : 10
% 32.35/4.54 # Processed clauses : 3949
% 32.35/4.54 # ...of these trivial : 296
% 32.35/4.54 # ...subsumed : 1792
% 32.35/4.54 # ...remaining for further processing : 1861
% 32.35/4.54 # Other redundant clauses eliminated : 0
% 32.35/4.54 # Clauses deleted for lack of memory : 0
% 32.35/4.54 # Backward-subsumed : 77
% 32.35/4.54 # Backward-rewritten : 62
% 32.35/4.54 # Generated clauses : 239013
% 32.35/4.54 # ...of the previous two non-redundant : 206532
% 32.35/4.54 # ...aggressively subsumed : 0
% 32.35/4.54 # Contextual simplify-reflections : 0
% 32.35/4.54 # Paramodulations : 238957
% 32.35/4.54 # Factorizations : 52
% 32.35/4.54 # NegExts : 0
% 32.35/4.54 # Equation resolutions : 0
% 32.35/4.54 # Total rewrite steps : 35002
% 32.35/4.54 # Propositional unsat checks : 0
% 32.35/4.54 # Propositional check models : 0
% 32.35/4.54 # Propositional check unsatisfiable : 0
% 32.35/4.54 # Propositional clauses : 0
% 32.35/4.54 # Propositional clauses after purity: 0
% 32.35/4.54 # Propositional unsat core size : 0
% 32.35/4.54 # Propositional preprocessing time : 0.000
% 32.35/4.54 # Propositional encoding time : 0.000
% 32.35/4.54 # Propositional solver time : 0.000
% 32.35/4.54 # Success case prop preproc time : 0.000
% 32.35/4.54 # Success case prop encoding time : 0.000
% 32.35/4.54 # Success case prop solver time : 0.000
% 32.35/4.54 # Current number of processed clauses : 1708
% 32.35/4.54 # Positive orientable unit clauses : 377
% 32.35/4.54 # Positive unorientable unit clauses: 0
% 32.35/4.54 # Negative unit clauses : 14
% 32.35/4.54 # Non-unit-clauses : 1317
% 32.35/4.54 # Current number of unprocessed clauses: 202108
% 32.35/4.54 # ...number of literals in the above : 656884
% 32.35/4.54 # Current number of archived formulas : 0
% 32.35/4.54 # Current number of archived clauses : 153
% 32.35/4.54 # Clause-clause subsumption calls (NU) : 173048
% 32.35/4.54 # Rec. Clause-clause subsumption calls : 141312
% 32.35/4.54 # Non-unit clause-clause subsumptions : 1757
% 32.35/4.54 # Unit Clause-clause subsumption calls : 5122
% 32.35/4.54 # Rewrite failures with RHS unbound : 0
% 32.35/4.54 # BW rewrite match attempts : 10397
% 32.35/4.54 # BW rewrite match successes : 46
% 32.35/4.54 # Condensation attempts : 0
% 32.35/4.54 # Condensation successes : 0
% 32.35/4.54 # Termbank termtop insertions : 7835222
% 32.35/4.54
% 32.35/4.54 # -------------------------------------------------
% 32.35/4.54 # User time : 3.966 s
% 32.35/4.54 # System time : 0.122 s
% 32.35/4.54 # Total time : 4.088 s
% 32.35/4.54 # Maximum resident set size: 1592 pages
% 32.35/4.54
% 32.35/4.54 # -------------------------------------------------
% 32.35/4.54 # User time : 20.323 s
% 32.35/4.54 # System time : 0.222 s
% 32.35/4.54 # Total time : 20.545 s
% 32.35/4.54 # Maximum resident set size: 1680 pages
% 32.35/4.54 % E---3.1 exiting
%------------------------------------------------------------------------------