TSTP Solution File: SWV246-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV246-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Sat May 4 09:52:14 EDT 2024
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 11 unt; 7 nHn; 24 RR)
% Number of literals : 59 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 68 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUnE_0,axiom,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
file('/export/starexec/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_Set_OUnE_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_conjecture_2) ).
cnf(cls_Set_OUnCI_1,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_Set_OUnCI_1) ).
cnf(cls_Message_OMPair__analz_0,axiom,
( c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_Message_OMPair__analz_0) ).
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/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_Message_Oanalz_OInj_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_conjecture_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/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_Set_OUnCI_0) ).
cnf(cls_Message_OMPair__synth_0,axiom,
( c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p',cls_Message_OMPair__synth_0) ).
cnf(c_0_8,plain,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_10,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_11,plain,
( c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OMPair__analz_0]) ).
cnf(c_0_12,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_OInj_0]) ).
cnf(c_0_13,plain,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_15,negated_conjecture,
~ c_in(v_Y,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
c_0_9 ).
cnf(c_0_16,plain,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_17,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_18,plain,
( c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg) ),
c_0_11 ).
cnf(c_0_19,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
c_0_12 ).
cnf(c_0_20,plain,
( c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OMPair__synth_0]) ).
cnf(c_0_21,negated_conjecture,
( c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ c_in(v_Y,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_24,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X3,X1),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OMPair(X1,X2),X3,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ c_in(v_Y,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_28,plain,
( c_in(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X4,X1),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
c_in(v_Y,c_Message_Oanalz(c_union(v_G,X1,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV246-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n017.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 : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 17:14:52 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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/tmp/tmp.qdyPvX0eyY/E---3.1_31444.p
% 0.15/0.41 # Version: 3.1.0
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 31522 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 31526 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 8
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 8
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 8
% 0.15/0.41 # Processed clauses : 56
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 56
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 5
% 0.15/0.41 # Generated clauses : 69
% 0.15/0.41 # ...of the previous two non-redundant : 67
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 69
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Disequality decompositions : 0
% 0.15/0.41 # Total rewrite steps : 5
% 0.15/0.41 # ...of those cached : 0
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 43
% 0.15/0.41 # Positive orientable unit clauses : 23
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 5
% 0.15/0.41 # Non-unit-clauses : 15
% 0.15/0.41 # Current number of unprocessed clauses: 23
% 0.15/0.41 # ...number of literals in the above : 42
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 13
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 52
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 52
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 18
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 127
% 0.15/0.41 # BW rewrite match successes : 5
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 1441
% 0.15/0.41 # Search garbage collected termcells : 18
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.002 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.005 s
% 0.15/0.41 # Maximum resident set size: 1616 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.002 s
% 0.15/0.41 # System time : 0.006 s
% 0.15/0.41 # Total time : 0.008 s
% 0.15/0.41 # Maximum resident set size: 1700 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------