TSTP Solution File: SWV244-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV244-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:47 EDT 2024
% Result : Unsatisfiable 0.16s 0.43s
% Output : CNFRefutation 0.16s
% 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/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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,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_12,plain,
( c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
c_0_10 ).
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)
| 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,negated_conjecture,
~ c_in(v_X,c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
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,v_H,tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
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.03/0.11 % Problem : SWV244-2 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n028.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 : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 08:28:22 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 # Version: 3.1.0
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 27355 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # SAT001_MinMin_p005000_rr_RG with pid 27358 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGUNF-FFSF31-MFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Unsatisfiable
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 6
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 6
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 6
% 0.16/0.43 # Processed clauses : 17
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 17
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 0
% 0.16/0.43 # Generated clauses : 8
% 0.16/0.43 # ...of the previous two non-redundant : 5
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 8
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 0
% 0.16/0.43 # ...of those cached : 0
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 11
% 0.16/0.43 # Positive orientable unit clauses : 1
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 6
% 0.16/0.43 # Non-unit-clauses : 4
% 0.16/0.43 # Current number of unprocessed clauses: 0
% 0.16/0.43 # ...number of literals in the above : 0
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 6
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 4
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 4
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 12
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 0
% 0.16/0.43 # BW rewrite match successes : 0
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 243
% 0.16/0.43 # Search garbage collected termcells : 12
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.001 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.003 s
% 0.16/0.43 # Maximum resident set size: 1628 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.003 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.005 s
% 0.16/0.43 # Maximum resident set size: 1692 pages
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------