TSTP Solution File: SWV261-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV261-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:56:33 EDT 2023
% Result : Unsatisfiable 168.04s 21.89s
% Output : CNFRefutation 168.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 9 unt; 6 nHn; 19 RR)
% Number of literals : 55 ( 5 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 74 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__trans_0,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.akx6Q5E698/E---3.1_30734.p',cls_Set_Osubset__trans_0) ).
cnf(cls_Message_Oparts__mono_0,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/tmp/tmp.akx6Q5E698/E---3.1_30734.p',cls_Message_Oparts__mono_0) ).
cnf(cls_Message_Oparts__Un__subset2_0,axiom,
c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/tmp/tmp.akx6Q5E698/E---3.1_30734.p',cls_Message_Oparts__Un__subset2_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.akx6Q5E698/E---3.1_30734.p',cls_Set_OsubsetI_1) ).
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.akx6Q5E698/E---3.1_30734.p',cls_Set_OUnCI_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.akx6Q5E698/E---3.1_30734.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.akx6Q5E698/E---3.1_30734.p',cls_Set_OsubsetI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/tmp/tmp.akx6Q5E698/E---3.1_30734.p',cls_conjecture_1) ).
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.akx6Q5E698/E---3.1_30734.p',cls_Set_OUnCI_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.akx6Q5E698/E---3.1_30734.p',cls_conjecture_0) ).
cnf(c_0_10,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
cls_Set_Osubset__trans_0 ).
cnf(c_0_11,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
cls_Message_Oparts__mono_0 ).
cnf(c_0_12,plain,
( c_lessequals(c_Message_Oparts(X1),X2,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X3),X2,tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X3,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
cls_Message_Oparts__Un__subset2_0 ).
cnf(c_0_14,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_15,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUnCI_0 ).
cnf(c_0_16,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_17,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_18,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
cls_conjecture_1 ).
cnf(c_0_19,plain,
( c_lessequals(c_Message_Oparts(X1),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_union(X2,X3,tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,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_16,c_0_17]) ).
cnf(c_0_22,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUnCI_1 ).
cnf(c_0_23,negated_conjecture,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,X3),c_union(X4,X2,X3),X3) = X1
| c_lessequals(c_insert(X1,X2,X3),c_union(X4,X2,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWV261-1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 04:11:31 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.15/0.51 Running first-order model finding
% 0.15/0.51 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.akx6Q5E698/E---3.1_30734.p
% 168.04/21.89 # Version: 3.1pre001
% 168.04/21.89 # Preprocessing class: FMLMSMSMSSSNFFN.
% 168.04/21.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 168.04/21.89 # Starting new_bool_3 with 300s (1) cores
% 168.04/21.89 # Starting new_bool_1 with 300s (1) cores
% 168.04/21.89 # Starting sh5l with 300s (1) cores
% 168.04/21.89 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30811 completed with status 0
% 168.04/21.89 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 168.04/21.89 # Preprocessing class: FMLMSMSMSSSNFFN.
% 168.04/21.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 168.04/21.89 # No SInE strategy applied
% 168.04/21.89 # Search class: FGHSM-SSLM32-MFFFFFNN
% 168.04/21.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 168.04/21.89 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 168.04/21.89 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 168.04/21.89 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 168.04/21.89 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 30820 completed with status 0
% 168.04/21.89 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 168.04/21.89 # Preprocessing class: FMLMSMSMSSSNFFN.
% 168.04/21.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 168.04/21.89 # No SInE strategy applied
% 168.04/21.89 # Search class: FGHSM-SSLM32-MFFFFFNN
% 168.04/21.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 168.04/21.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 168.04/21.89 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 168.04/21.89 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 168.04/21.89 # Preprocessing time : 0.009 s
% 168.04/21.89 # Presaturation interreduction done
% 168.04/21.89
% 168.04/21.89 # Proof found!
% 168.04/21.89 # SZS status Unsatisfiable
% 168.04/21.89 # SZS output start CNFRefutation
% See solution above
% 168.04/21.89 # Parsed axioms : 1403
% 168.04/21.89 # Removed by relevancy pruning/SinE : 0
% 168.04/21.89 # Initial clauses : 1403
% 168.04/21.89 # Removed in clause preprocessing : 1
% 168.04/21.89 # Initial clauses in saturation : 1402
% 168.04/21.89 # Processed clauses : 48933
% 168.04/21.89 # ...of these trivial : 1700
% 168.04/21.89 # ...subsumed : 39374
% 168.04/21.89 # ...remaining for further processing : 7859
% 168.04/21.89 # Other redundant clauses eliminated : 243
% 168.04/21.89 # Clauses deleted for lack of memory : 0
% 168.04/21.89 # Backward-subsumed : 252
% 168.04/21.89 # Backward-rewritten : 539
% 168.04/21.89 # Generated clauses : 627064
% 168.04/21.89 # ...of the previous two non-redundant : 545713
% 168.04/21.89 # ...aggressively subsumed : 0
% 168.04/21.89 # Contextual simplify-reflections : 17
% 168.04/21.89 # Paramodulations : 626665
% 168.04/21.89 # Factorizations : 114
% 168.04/21.89 # NegExts : 0
% 168.04/21.89 # Equation resolutions : 285
% 168.04/21.89 # Total rewrite steps : 970167
% 168.04/21.89 # Propositional unsat checks : 0
% 168.04/21.89 # Propositional check models : 0
% 168.04/21.89 # Propositional check unsatisfiable : 0
% 168.04/21.89 # Propositional clauses : 0
% 168.04/21.89 # Propositional clauses after purity: 0
% 168.04/21.89 # Propositional unsat core size : 0
% 168.04/21.89 # Propositional preprocessing time : 0.000
% 168.04/21.89 # Propositional encoding time : 0.000
% 168.04/21.89 # Propositional solver time : 0.000
% 168.04/21.89 # Success case prop preproc time : 0.000
% 168.04/21.89 # Success case prop encoding time : 0.000
% 168.04/21.89 # Success case prop solver time : 0.000
% 168.04/21.89 # Current number of processed clauses : 5705
% 168.04/21.89 # Positive orientable unit clauses : 635
% 168.04/21.89 # Positive unorientable unit clauses: 0
% 168.04/21.89 # Negative unit clauses : 380
% 168.04/21.89 # Non-unit-clauses : 4690
% 168.04/21.89 # Current number of unprocessed clauses: 494409
% 168.04/21.89 # ...number of literals in the above : 1633070
% 168.04/21.89 # Current number of archived formulas : 0
% 168.04/21.89 # Current number of archived clauses : 2154
% 168.04/21.89 # Clause-clause subsumption calls (NU) : 9966655
% 168.04/21.89 # Rec. Clause-clause subsumption calls : 7755536
% 168.04/21.89 # Non-unit clause-clause subsumptions : 18678
% 168.04/21.89 # Unit Clause-clause subsumption calls : 63000
% 168.04/21.89 # Rewrite failures with RHS unbound : 0
% 168.04/21.89 # BW rewrite match attempts : 2936
% 168.04/21.89 # BW rewrite match successes : 260
% 168.04/21.89 # Condensation attempts : 0
% 168.04/21.89 # Condensation successes : 0
% 168.04/21.89 # Termbank termtop insertions : 25522286
% 168.04/21.89
% 168.04/21.89 # -------------------------------------------------
% 168.04/21.89 # User time : 20.288 s
% 168.04/21.89 # System time : 0.528 s
% 168.04/21.89 # Total time : 20.816 s
% 168.04/21.89 # Maximum resident set size: 3796 pages
% 168.04/21.89
% 168.04/21.89 # -------------------------------------------------
% 168.04/21.89 # User time : 100.896 s
% 168.04/21.89 # System time : 3.019 s
% 168.04/21.89 # Total time : 103.916 s
% 168.04/21.89 # Maximum resident set size: 2432 pages
% 168.04/21.89 % E---3.1 exiting
%------------------------------------------------------------------------------