TSTP Solution File: SWV261-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV261-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:33:53 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 9 unt; 7 nHn; 23 RR)
% Number of literals : 71 ( 5 equ; 31 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 : 99 ( 6 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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__mono_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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(cls_Set_OUnCI_1,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
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/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_10,plain,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__trans_0]) ).
cnf(c_0_11,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__mono_0]) ).
cnf(c_0_12,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_13,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_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_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
c_0_10 ).
cnf(c_0_16,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
c_0_11 ).
cnf(c_0_17,plain,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_18,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_12 ).
cnf(c_0_19,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_13 ).
cnf(c_0_20,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
c_0_14 ).
cnf(c_0_21,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_22,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)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_23,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_15,c_0_16]) ).
cnf(c_0_24,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_25,plain,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_26,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_18,c_0_19]) ).
cnf(c_0_27,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_20,c_0_21]) ).
cnf(c_0_28,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)),
c_0_22 ).
cnf(c_0_29,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_23,c_0_24]) ).
cnf(c_0_30,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_18,c_0_25]) ).
cnf(c_0_31,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_26,c_0_27]) ).
cnf(c_0_32,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_28,c_0_29]) ).
cnf(c_0_33,plain,
( c_lessequals(c_insert(X1,X2,X3),c_union(X4,X2,X3),tc_set(X3))
| ~ c_in(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
c_in(v_X,v_G,tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWV261-2 : TPTP v8.2.0. Released v3.2.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 07:14:22 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # sh5l with pid 22085 completed with status 0
% 0.21/0.55 # Result found by sh5l
% 0.21/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.55 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # SAT001_MinMin_p005000_rr_RG with pid 22092 completed with status 0
% 0.21/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.55 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.001 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 10
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 10
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 10
% 0.21/0.55 # Processed clauses : 231
% 0.21/0.55 # ...of these trivial : 6
% 0.21/0.55 # ...subsumed : 72
% 0.21/0.55 # ...remaining for further processing : 153
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 0
% 0.21/0.55 # Backward-rewritten : 0
% 0.21/0.55 # Generated clauses : 1717
% 0.21/0.55 # ...of the previous two non-redundant : 1652
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 1717
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 70
% 0.21/0.55 # ...of those cached : 32
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 143
% 0.21/0.55 # Positive orientable unit clauses : 28
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 5
% 0.21/0.55 # Non-unit-clauses : 110
% 0.21/0.55 # Current number of unprocessed clauses: 1434
% 0.21/0.55 # ...number of literals in the above : 2411
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 10
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 2960
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 2936
% 0.21/0.55 # Non-unit clause-clause subsumptions : 72
% 0.21/0.55 # Unit Clause-clause subsumption calls : 12
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 92
% 0.21/0.55 # BW rewrite match successes : 0
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 31963
% 0.21/0.55 # Search garbage collected termcells : 20
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.030 s
% 0.21/0.55 # System time : 0.004 s
% 0.21/0.55 # Total time : 0.034 s
% 0.21/0.55 # Maximum resident set size: 1600 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.030 s
% 0.21/0.55 # System time : 0.007 s
% 0.21/0.55 # Total time : 0.037 s
% 0.21/0.55 # Maximum resident set size: 1696 pages
% 0.21/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------