TSTP Solution File: SWV242-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV242-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:56:27 EDT 2023
% Result : Unsatisfiable 0.42s 0.65s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 32 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 28 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__trans_0,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_Set_Osubset__trans_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_conjecture_1) ).
cnf(cls_Message_Oanalz__mono_0,axiom,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_Message_Oanalz__mono_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_conjecture_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_conjecture_2) ).
cnf(cls_Set_OUn__upper2_0,axiom,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_Set_OUn__upper2_0) ).
cnf(cls_Set_OUn__upper1_0,axiom,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
file('/export/starexec/sandbox2/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p',cls_Set_OUn__upper1_0) ).
cnf(c_0_7,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
cls_Set_Osubset__trans_0 ).
cnf(c_0_8,negated_conjecture,
c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
cls_conjecture_1 ).
cnf(c_0_9,negated_conjecture,
( c_lessequals(v_H,X1,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(v_H_H),X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
cls_Message_Oanalz__mono_0 ).
cnf(c_0_11,negated_conjecture,
c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
cls_conjecture_0 ).
cnf(c_0_12,negated_conjecture,
( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
cls_conjecture_2 ).
cnf(c_0_13,negated_conjecture,
( c_lessequals(v_H,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_H_H,X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
cls_Set_OUn__upper2_0 ).
cnf(c_0_15,negated_conjecture,
( c_lessequals(v_G,X1,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(v_G_H),X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
( c_lessequals(v_G,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G_H,X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_18,axiom,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
cls_Set_OUn__upper1_0 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV242-1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n014.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Oct 3 04:22:04 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.39/0.59 Running first-order model finding
% 0.39/0.59 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/tmp/tmp.Q7aenx4QG8/E---3.1_12391.p
% 0.42/0.65 # Version: 3.1pre001
% 0.42/0.65 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.42/0.65 # Starting sh5l with 300s (1) cores
% 0.42/0.65 # new_bool_3 with pid 12469 completed with status 0
% 0.42/0.65 # Result found by new_bool_3
% 0.42/0.65 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.65 # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.42/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.65 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.42/0.65 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 12472 completed with status 0
% 0.42/0.65 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.42/0.65 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.65 # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.42/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.65 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.42/0.65 # Preprocessing time : 0.005 s
% 0.42/0.65
% 0.42/0.65 # Proof found!
% 0.42/0.65 # SZS status Unsatisfiable
% 0.42/0.65 # SZS output start CNFRefutation
% See solution above
% 0.42/0.65 # Parsed axioms : 1392
% 0.42/0.65 # Removed by relevancy pruning/SinE : 984
% 0.42/0.65 # Initial clauses : 408
% 0.42/0.65 # Removed in clause preprocessing : 0
% 0.42/0.65 # Initial clauses in saturation : 408
% 0.42/0.65 # Processed clauses : 597
% 0.42/0.65 # ...of these trivial : 1
% 0.42/0.65 # ...subsumed : 118
% 0.42/0.65 # ...remaining for further processing : 478
% 0.42/0.65 # Other redundant clauses eliminated : 0
% 0.42/0.65 # Clauses deleted for lack of memory : 0
% 0.42/0.65 # Backward-subsumed : 6
% 0.42/0.65 # Backward-rewritten : 2
% 0.42/0.65 # Generated clauses : 571
% 0.42/0.65 # ...of the previous two non-redundant : 414
% 0.42/0.65 # ...aggressively subsumed : 0
% 0.42/0.65 # Contextual simplify-reflections : 1
% 0.42/0.65 # Paramodulations : 566
% 0.42/0.65 # Factorizations : 0
% 0.42/0.65 # NegExts : 0
% 0.42/0.65 # Equation resolutions : 5
% 0.42/0.65 # Total rewrite steps : 116
% 0.42/0.65 # Propositional unsat checks : 0
% 0.42/0.65 # Propositional check models : 0
% 0.42/0.65 # Propositional check unsatisfiable : 0
% 0.42/0.65 # Propositional clauses : 0
% 0.42/0.65 # Propositional clauses after purity: 0
% 0.42/0.65 # Propositional unsat core size : 0
% 0.42/0.65 # Propositional preprocessing time : 0.000
% 0.42/0.65 # Propositional encoding time : 0.000
% 0.42/0.65 # Propositional solver time : 0.000
% 0.42/0.65 # Success case prop preproc time : 0.000
% 0.42/0.65 # Success case prop encoding time : 0.000
% 0.42/0.65 # Success case prop solver time : 0.000
% 0.42/0.65 # Current number of processed clauses : 470
% 0.42/0.65 # Positive orientable unit clauses : 45
% 0.42/0.65 # Positive unorientable unit clauses: 0
% 0.42/0.65 # Negative unit clauses : 6
% 0.42/0.65 # Non-unit-clauses : 419
% 0.42/0.65 # Current number of unprocessed clauses: 218
% 0.42/0.65 # ...number of literals in the above : 676
% 0.42/0.65 # Current number of archived formulas : 0
% 0.42/0.65 # Current number of archived clauses : 8
% 0.42/0.65 # Clause-clause subsumption calls (NU) : 62825
% 0.42/0.65 # Rec. Clause-clause subsumption calls : 51965
% 0.42/0.65 # Non-unit clause-clause subsumptions : 119
% 0.42/0.65 # Unit Clause-clause subsumption calls : 112
% 0.42/0.65 # Rewrite failures with RHS unbound : 0
% 0.42/0.65 # BW rewrite match attempts : 60
% 0.42/0.65 # BW rewrite match successes : 2
% 0.42/0.65 # Condensation attempts : 0
% 0.42/0.65 # Condensation successes : 0
% 0.42/0.65 # Termbank termtop insertions : 19945
% 0.42/0.65
% 0.42/0.65 # -------------------------------------------------
% 0.42/0.65 # User time : 0.025 s
% 0.42/0.65 # System time : 0.007 s
% 0.42/0.65 # Total time : 0.032 s
% 0.42/0.65 # Maximum resident set size: 3092 pages
% 0.42/0.65
% 0.42/0.65 # -------------------------------------------------
% 0.42/0.65 # User time : 0.038 s
% 0.42/0.65 # System time : 0.008 s
% 0.42/0.65 # Total time : 0.046 s
% 0.42/0.65 # Maximum resident set size: 2424 pages
% 0.42/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------