TSTP Solution File: SWV275-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV275-2 : 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:43:59 EDT 2023
% Result : Unsatisfiable 229.09s 29.31s
% Output : CNFRefutation 229.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 7 unt; 6 nHn; 18 RR)
% Number of literals : 55 ( 5 equ; 22 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 75 ( 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/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OinsertCI_0,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Set_OinsertCI_0) ).
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Set_OsubsetD_0) ).
cnf(cls_Message_Osynth__mono_0,axiom,
( c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Message_Osynth__mono_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/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Set_OsubsetI_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/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Set_OinsertE_0) ).
cnf(cls_Message_Osynth_OInj_0,axiom,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
file('/export/starexec/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Message_Osynth_OInj_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_conjecture_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p',cls_Set_OinsertCI_1) ).
cnf(c_0_9,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_10,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OinsertCI_0 ).
cnf(c_0_11,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
cls_Set_OsubsetD_0 ).
cnf(c_0_12,axiom,
( c_lessequals(c_Message_Osynth(X1),c_Message_Osynth(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
cls_Message_Osynth__mono_0 ).
cnf(c_0_13,plain,
( c_lessequals(X1,c_insert(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_insert(X2,X3,X4),X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,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_15,plain,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_lessequals(X3,X2,tc_set(tc_Message_Omsg))
| ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( c_in(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_19,plain,
( c_lessequals(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Osynth(c_insert(X2,X3,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,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_18,c_0_14]) ).
cnf(c_0_21,axiom,
( c_in(X1,c_Message_Osynth(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
cls_Message_Osynth_OInj_0 ).
cnf(c_0_22,negated_conjecture,
~ c_lessequals(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
cls_conjecture_0 ).
cnf(c_0_23,plain,
( c_Main_OsubsetI__1(c_insert(X1,c_Message_Osynth(X2),tc_Message_Omsg),c_Message_Osynth(c_insert(X3,X2,tc_Message_Omsg)),tc_Message_Omsg) = X1
| c_lessequals(c_insert(X1,c_Message_Osynth(X2),tc_Message_Omsg),c_Message_Osynth(c_insert(X3,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( c_lessequals(X1,c_Message_Osynth(X2),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Osynth(X2),tc_Message_Omsg),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
c_Main_OsubsetI__1(c_insert(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) = v_X,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV275-2 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 03:27:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.SkJDWp2uJt/E---3.1_26255.p
% 229.09/29.31 # Version: 3.1pre001
% 229.09/29.31 # Preprocessing class: FSMSSMSSSSSNFFN.
% 229.09/29.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 229.09/29.31 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 229.09/29.31 # Starting new_bool_3 with 300s (1) cores
% 229.09/29.31 # Starting new_bool_1 with 300s (1) cores
% 229.09/29.31 # Starting sh5l with 300s (1) cores
% 229.09/29.31 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26333 completed with status 0
% 229.09/29.31 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 229.09/29.31 # Preprocessing class: FSMSSMSSSSSNFFN.
% 229.09/29.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 229.09/29.31 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 229.09/29.31 # No SInE strategy applied
% 229.09/29.31 # Search class: FGUSF-FFSF32-SFFFFFNN
% 229.09/29.31 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 229.09/29.31 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 229.09/29.31 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 229.09/29.31 # Starting new_bool_3 with 136s (1) cores
% 229.09/29.31 # Starting new_bool_1 with 136s (1) cores
% 229.09/29.31 # Starting sh5l with 136s (1) cores
% 229.09/29.31 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26338 completed with status 0
% 229.09/29.31 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 229.09/29.31 # Preprocessing class: FSMSSMSSSSSNFFN.
% 229.09/29.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 229.09/29.31 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 229.09/29.31 # No SInE strategy applied
% 229.09/29.31 # Search class: FGUSF-FFSF32-SFFFFFNN
% 229.09/29.31 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 229.09/29.31 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 229.09/29.31 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 229.09/29.31 # Preprocessing time : 0.001 s
% 229.09/29.31 # Presaturation interreduction done
% 229.09/29.31
% 229.09/29.31 # Proof found!
% 229.09/29.31 # SZS status Unsatisfiable
% 229.09/29.31 # SZS output start CNFRefutation
% See solution above
% 229.09/29.31 # Parsed axioms : 9
% 229.09/29.31 # Removed by relevancy pruning/SinE : 0
% 229.09/29.31 # Initial clauses : 9
% 229.09/29.31 # Removed in clause preprocessing : 0
% 229.09/29.31 # Initial clauses in saturation : 9
% 229.09/29.31 # Processed clauses : 12338
% 229.09/29.31 # ...of these trivial : 378
% 229.09/29.31 # ...subsumed : 7734
% 229.09/29.31 # ...remaining for further processing : 4226
% 229.09/29.31 # Other redundant clauses eliminated : 0
% 229.09/29.31 # Clauses deleted for lack of memory : 0
% 229.09/29.31 # Backward-subsumed : 1
% 229.09/29.31 # Backward-rewritten : 86
% 229.09/29.31 # Generated clauses : 1746698
% 229.09/29.31 # ...of the previous two non-redundant : 1745399
% 229.09/29.31 # ...aggressively subsumed : 0
% 229.09/29.31 # Contextual simplify-reflections : 0
% 229.09/29.31 # Paramodulations : 1746698
% 229.09/29.31 # Factorizations : 0
% 229.09/29.31 # NegExts : 0
% 229.09/29.31 # Equation resolutions : 0
% 229.09/29.31 # Total rewrite steps : 1740
% 229.09/29.31 # Propositional unsat checks : 0
% 229.09/29.31 # Propositional check models : 0
% 229.09/29.31 # Propositional check unsatisfiable : 0
% 229.09/29.31 # Propositional clauses : 0
% 229.09/29.31 # Propositional clauses after purity: 0
% 229.09/29.31 # Propositional unsat core size : 0
% 229.09/29.31 # Propositional preprocessing time : 0.000
% 229.09/29.31 # Propositional encoding time : 0.000
% 229.09/29.31 # Propositional solver time : 0.000
% 229.09/29.31 # Success case prop preproc time : 0.000
% 229.09/29.31 # Success case prop encoding time : 0.000
% 229.09/29.31 # Success case prop solver time : 0.000
% 229.09/29.31 # Current number of processed clauses : 4130
% 229.09/29.31 # Positive orientable unit clauses : 1120
% 229.09/29.31 # Positive unorientable unit clauses: 0
% 229.09/29.31 # Negative unit clauses : 1
% 229.09/29.31 # Non-unit-clauses : 3009
% 229.09/29.31 # Current number of unprocessed clauses: 1732980
% 229.09/29.31 # ...number of literals in the above : 3543078
% 229.09/29.31 # Current number of archived formulas : 0
% 229.09/29.31 # Current number of archived clauses : 96
% 229.09/29.31 # Clause-clause subsumption calls (NU) : 1475635
% 229.09/29.31 # Rec. Clause-clause subsumption calls : 1464031
% 229.09/29.31 # Non-unit clause-clause subsumptions : 7735
% 229.09/29.31 # Unit Clause-clause subsumption calls : 20472
% 229.09/29.31 # Rewrite failures with RHS unbound : 0
% 229.09/29.31 # BW rewrite match attempts : 248374
% 229.09/29.31 # BW rewrite match successes : 86
% 229.09/29.31 # Condensation attempts : 0
% 229.09/29.31 # Condensation successes : 0
% 229.09/29.31 # Termbank termtop insertions : 62085330
% 229.09/29.31
% 229.09/29.31 # -------------------------------------------------
% 229.09/29.31 # User time : 27.770 s
% 229.09/29.31 # System time : 0.879 s
% 229.09/29.31 # Total time : 28.649 s
% 229.09/29.31 # Maximum resident set size: 1628 pages
% 229.09/29.31
% 229.09/29.31 # -------------------------------------------------
% 229.09/29.31 # User time : 140.947 s
% 229.09/29.31 # System time : 1.771 s
% 229.09/29.31 # Total time : 142.717 s
% 229.09/29.31 # Maximum resident set size: 1680 pages
% 229.09/29.31 % E---3.1 exiting
% 229.09/29.31 % E---3.1 exiting
%------------------------------------------------------------------------------