TSTP Solution File: SWV244-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV244-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:21:50 EDT 2024
% Result : Unsatisfiable 0.50s 0.65s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 10 unt; 3 nHn; 16 RR)
% Number of literals : 37 ( 0 equ; 19 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 : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 42 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_X,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/sandbox2/benchmark/theBenchmark.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/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_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/benchmark/Axioms/SWV004-0.ax',cls_Message_Oanalz_OInj_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).
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/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnE_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_6,negated_conjecture,
~ c_in(v_X,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_1]) ).
cnf(c_0_7,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_8,negated_conjecture,
~ c_in(v_X,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_6 ).
cnf(c_0_9,plain,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_7 ).
cnf(c_0_10,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_11,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_12,negated_conjecture,
~ c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
c_0_10 ).
cnf(c_0_14,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_15,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
~ c_in(v_X,c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_19,negated_conjecture,
~ c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(v_X,v_H,tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV244-1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 07:17:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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/benchmark/theBenchmark.p
% 0.50/0.65 # Version: 3.1.0
% 0.50/0.65 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.50/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.50/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.65 # Starting sh5l with 300s (1) cores
% 0.50/0.65 # new_bool_1 with pid 28308 completed with status 0
% 0.50/0.65 # Result found by new_bool_1
% 0.50/0.65 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.50/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.50/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.65 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.50/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.65 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.50/0.65 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 28311 completed with status 0
% 0.50/0.65 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.50/0.65 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.50/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.50/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.65 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.50/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.65 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.50/0.65 # Preprocessing time : 0.003 s
% 0.50/0.65
% 0.50/0.65 # Proof found!
% 0.50/0.65 # SZS status Unsatisfiable
% 0.50/0.65 # SZS output start CNFRefutation
% See solution above
% 0.50/0.65 # Parsed axioms : 1402
% 0.50/0.65 # Removed by relevancy pruning/SinE : 1320
% 0.50/0.65 # Initial clauses : 82
% 0.50/0.65 # Removed in clause preprocessing : 0
% 0.50/0.65 # Initial clauses in saturation : 82
% 0.50/0.65 # Processed clauses : 96
% 0.50/0.65 # ...of these trivial : 1
% 0.50/0.65 # ...subsumed : 10
% 0.50/0.65 # ...remaining for further processing : 84
% 0.50/0.65 # Other redundant clauses eliminated : 0
% 0.50/0.65 # Clauses deleted for lack of memory : 0
% 0.50/0.65 # Backward-subsumed : 0
% 0.50/0.65 # Backward-rewritten : 1
% 0.50/0.65 # Generated clauses : 70
% 0.50/0.65 # ...of the previous two non-redundant : 43
% 0.50/0.65 # ...aggressively subsumed : 0
% 0.50/0.65 # Contextual simplify-reflections : 0
% 0.50/0.65 # Paramodulations : 66
% 0.50/0.65 # Factorizations : 0
% 0.50/0.65 # NegExts : 0
% 0.50/0.65 # Equation resolutions : 4
% 0.50/0.65 # Disequality decompositions : 0
% 0.50/0.65 # Total rewrite steps : 13
% 0.50/0.65 # ...of those cached : 6
% 0.50/0.65 # Propositional unsat checks : 0
% 0.50/0.65 # Propositional check models : 0
% 0.50/0.65 # Propositional check unsatisfiable : 0
% 0.50/0.65 # Propositional clauses : 0
% 0.50/0.65 # Propositional clauses after purity: 0
% 0.50/0.65 # Propositional unsat core size : 0
% 0.50/0.65 # Propositional preprocessing time : 0.000
% 0.50/0.65 # Propositional encoding time : 0.000
% 0.50/0.65 # Propositional solver time : 0.000
% 0.50/0.65 # Success case prop preproc time : 0.000
% 0.50/0.65 # Success case prop encoding time : 0.000
% 0.50/0.65 # Success case prop solver time : 0.000
% 0.50/0.65 # Current number of processed clauses : 83
% 0.50/0.65 # Positive orientable unit clauses : 10
% 0.50/0.65 # Positive unorientable unit clauses: 0
% 0.50/0.65 # Negative unit clauses : 11
% 0.50/0.65 # Non-unit-clauses : 62
% 0.50/0.65 # Current number of unprocessed clauses: 29
% 0.50/0.65 # ...number of literals in the above : 67
% 0.50/0.65 # Current number of archived formulas : 0
% 0.50/0.65 # Current number of archived clauses : 1
% 0.50/0.65 # Clause-clause subsumption calls (NU) : 980
% 0.50/0.65 # Rec. Clause-clause subsumption calls : 947
% 0.50/0.65 # Non-unit clause-clause subsumptions : 5
% 0.50/0.65 # Unit Clause-clause subsumption calls : 40
% 0.50/0.65 # Rewrite failures with RHS unbound : 0
% 0.50/0.65 # BW rewrite match attempts : 2
% 0.50/0.65 # BW rewrite match successes : 1
% 0.50/0.65 # Condensation attempts : 0
% 0.50/0.65 # Condensation successes : 0
% 0.50/0.65 # Termbank termtop insertions : 10289
% 0.50/0.65 # Search garbage collected termcells : 2717
% 0.50/0.65
% 0.50/0.65 # -------------------------------------------------
% 0.50/0.65 # User time : 0.010 s
% 0.50/0.65 # System time : 0.004 s
% 0.50/0.65 # Total time : 0.014 s
% 0.50/0.65 # Maximum resident set size: 2848 pages
% 0.50/0.65
% 0.50/0.65 # -------------------------------------------------
% 0.50/0.65 # User time : 0.032 s
% 0.50/0.65 # System time : 0.006 s
% 0.50/0.65 # Total time : 0.038 s
% 0.50/0.65 # Maximum resident set size: 2440 pages
% 0.50/0.65 % E---3.1 exiting
% 0.50/0.65 % E exiting
%------------------------------------------------------------------------------