TSTP Solution File: SWV241-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV241-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:49 EDT 2023
% Result : Unsatisfiable 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 9 unt; 9 nHn; 21 RR)
% Number of literals : 50 ( 6 equ; 16 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 : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 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.7BsEXOODbl/E---3.1_16313.p',cls_Message_Oanalz__trans_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.7BsEXOODbl/E---3.1_16313.p',cls_Set_OsubsetI_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.7BsEXOODbl/E---3.1_16313.p',cls_conjecture_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.7BsEXOODbl/E---3.1_16313.p',cls_Set_OsubsetI_1) ).
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.7BsEXOODbl/E---3.1_16313.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.7BsEXOODbl/E---3.1_16313.p',cls_Set_OinsertE_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.7BsEXOODbl/E---3.1_16313.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.7BsEXOODbl/E---3.1_16313.p',cls_conjecture_1) ).
cnf(c_0_8,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)) ),
cls_Message_Oanalz__trans_0 ).
cnf(c_0_9,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_10,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_8,c_0_9]) ).
cnf(c_0_11,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_12,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_13,axiom,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
cls_Message_Oanalz_OInj_0 ).
cnf(c_0_14,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_15,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_10,c_0_11]) ).
cnf(c_0_16,plain,
( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Message_Oanalz(X2),tc_Message_Omsg),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,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_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(v_H),tc_Message_Omsg),
cls_conjecture_2 ).
cnf(c_0_19,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_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,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(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_21,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_20,c_0_11]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
c_in(v_X,c_Message_Oanalz(v_H),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_23,negated_conjecture,
c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_22])]) ).
cnf(c_0_24,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(spm,[status(thm)],[c_0_8,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_11]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV241-2 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n016.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.16/0.31 % DateTime : Tue Oct 3 04:22:22 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.7BsEXOODbl/E---3.1_16313.p
% 0.16/0.42 # Version: 3.1pre001
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # sh5l with pid 16394 completed with status 0
% 0.16/0.42 # Result found by sh5l
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.42 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # SAT001_MinMin_p005000_rr_RG with pid 16400 completed with status 0
% 0.16/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.42 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Unsatisfiable
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 8
% 0.16/0.42 # Removed by relevancy pruning/SinE : 0
% 0.16/0.42 # Initial clauses : 8
% 0.16/0.42 # Removed in clause preprocessing : 0
% 0.16/0.42 # Initial clauses in saturation : 8
% 0.16/0.42 # Processed clauses : 46
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 3
% 0.16/0.42 # ...remaining for further processing : 43
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 2
% 0.16/0.42 # Generated clauses : 94
% 0.16/0.42 # ...of the previous two non-redundant : 69
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 94
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Total rewrite steps : 24
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 33
% 0.16/0.42 # Positive orientable unit clauses : 10
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 2
% 0.16/0.42 # Non-unit-clauses : 21
% 0.16/0.42 # Current number of unprocessed clauses: 39
% 0.16/0.42 # ...number of literals in the above : 111
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 10
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 75
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 70
% 0.16/0.42 # Non-unit clause-clause subsumptions : 3
% 0.16/0.42 # Unit Clause-clause subsumption calls : 15
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 9
% 0.16/0.42 # BW rewrite match successes : 1
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 2253
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.002 s
% 0.16/0.42 # System time : 0.003 s
% 0.16/0.42 # Total time : 0.005 s
% 0.16/0.42 # Maximum resident set size: 1640 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.005 s
% 0.16/0.42 # System time : 0.003 s
% 0.16/0.42 # Total time : 0.008 s
% 0.16/0.42 # Maximum resident set size: 1676 pages
% 0.16/0.42 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------