↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SCT042-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:07:37 PM UTC 2026

% Result   : Unsatisfiable 0.13s 15.61s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (   8 unt;   2 nHn;  11 RR)
%            Number of literals    :   18 (   5 equ;  10 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :    8 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
    ( ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X1,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt)
    | v_thesis____ ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_that_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ v_thesis____,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_CHAINED_0_01,axiom,
    v_a____ != v_b____,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).

cnf(cls_third__alt_0,axiom,
    ( X1 = X2
    | c_List_Odistinct(c_List_Olist_OCons(X1,c_List_Olist_OCons(X2,c_List_Olist_OCons(v_sko__Arrow__Order__Mirabelle__Xthird__alt__1(X1,X2),c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_third__alt_0) ).

cnf(c_0_4,plain,
    ( ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X1,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt)
    | v_thesis____ ),
    inference(fof_simplification,[status(thm)],[cls_that_0]) ).

cnf(c_0_5,negated_conjecture,
    ~ v_thesis____,
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_6,plain,
    ( ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X1,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt)
    | v_thesis____ ),
    c_0_4 ).

cnf(c_0_7,negated_conjecture,
    ~ v_thesis____,
    c_0_5 ).

cnf(c_0_8,plain,
    v_a____ != v_b____,
    inference(fof_simplification,[status(thm)],[cls_CHAINED_0_01]) ).

cnf(c_0_9,plain,
    ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X1,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),
    inference(sr,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    ( X1 = X2
    | c_List_Odistinct(c_List_Olist_OCons(X1,c_List_Olist_OCons(X2,c_List_Olist_OCons(v_sko__Arrow__Order__Mirabelle__Xthird__alt__1(X1,X2),c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt) ),
    cls_third__alt_0 ).

cnf(c_0_11,plain,
    v_a____ != v_b____,
    c_0_8 ).

cnf(c_0_12,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SCT042-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/15.36  % Computer : n003.cluster.edu
% 0.10/15.36  % Model    : x86_64 x86_64
% 0.10/15.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.36  % Memory   : 8046.5625MB
% 0.10/15.36  % OS       : Linux 6.8.0-71-generic
% 0.10/15.36  % CPULimit : 300
% 0.10/15.36  % WCLimit  : 300
% 0.10/15.36  % DateTime : Mon Sep 21 04:29:31 UTC 2026
% 0.10/15.36  % CPUTime  : 
% 0.10/15.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/15.40  Running first-order theorem proving
% 0.13/15.40  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.13/15.61  % Version: 3.5.1
% 0.13/15.61  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/15.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.61  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/15.61  % Starting new_bool_3 with 300s (1) cores
% 0.13/15.61  % Starting new_bool_1 with 300s (1) cores
% 0.13/15.61  % Starting sh5l with 300s (1) cores
% 0.13/15.61  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3404120 completed with status 0
% 0.13/15.61  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/15.61  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/15.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.61  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/15.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/15.61  % No SInE strategy applied
% 0.13/15.61  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.13/15.61  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/15.61  % Starting SubtermCWHack with 136s (1) cores
% 0.13/15.61  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/15.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 0.13/15.61  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.13/15.61  % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.13/15.61  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3404129 completed with status 0
% 0.13/15.61  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/15.61  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/15.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.61  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/15.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/15.61  % No SInE strategy applied
% 0.13/15.61  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.13/15.61  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/15.61  % Starting SubtermCWHack with 136s (1) cores
% 0.13/15.61  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/15.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 0.13/15.61  % Preprocessing time       : 0.009 s
% 0.13/15.61  % Presaturation interreduction done
% 0.13/15.61  
% 0.13/15.61  % Proof found!
% 0.13/15.61  % SZS status Unsatisfiable
% 0.13/15.61  % SZS output start CNFRefutation
% See solution above
% 0.13/15.61  % Parsed axioms                        : 666
% 0.13/15.61  % Removed by relevancy pruning/SinE    : 0
% 0.13/15.61  % Initial clauses                      : 666
% 0.13/15.61  % Removed in clause preprocessing      : 3
% 0.13/15.61  % Initial clauses in saturation        : 663
% 0.13/15.61  % Processed clauses                    : 884
% 0.13/15.61  % ...of these trivial                  : 49
% 0.13/15.61  % ...subsumed                          : 93
% 0.13/15.61  % ...remaining for further processing  : 742
% 0.13/15.61  % Other redundant clauses eliminated   : 18
% 0.13/15.61  % Clauses deleted for lack of memory   : 0
% 0.13/15.61  % Backward-subsumed                    : 0
% 0.13/15.61  % Backward-rewritten                   : 6
% 0.13/15.61  % Generated clauses                    : 390
% 0.13/15.61  % ...of the previous two non-redundant : 212
% 0.13/15.61  % ...aggressively subsumed             : 0
% 0.13/15.61  % Contextual simplify-reflections      : 0
% 0.13/15.61  % Paramodulations                      : 362
% 0.13/15.61  % Factorizations                       : 0
% 0.13/15.61  % NegExts                              : 0
% 0.13/15.61  % Equation resolutions                 : 28
% 0.13/15.61  % Disequality decompositions           : 0
% 0.13/15.61  % Total rewrite steps                  : 369
% 0.13/15.61  % ...of those cached                   : 266
% 0.13/15.61  % Propositional unsat checks           : 0
% 0.13/15.61  %    Propositional check models        : 0
% 0.13/15.61  %    Propositional check unsatisfiable : 0
% 0.13/15.61  %    Propositional clauses             : 0
% 0.13/15.61  %    Propositional clauses after purity: 0
% 0.13/15.61  %    Propositional unsat core size     : 0
% 0.13/15.61  %    Propositional preprocessing time  : 0.000
% 0.13/15.61  %    Propositional encoding time       : 0.000
% 0.13/15.61  %    Propositional solver time         : 0.000
% 0.13/15.61  %    Success case prop preproc time    : 0.000
% 0.13/15.61  %    Success case prop encoding time   : 0.000
% 0.13/15.61  %    Success case prop solver time     : 0.000
% 0.13/15.61  % Current number of processed clauses  : 216
% 0.13/15.61  %    Positive orientable unit clauses  : 103
% 0.13/15.61  %    Positive unorientable unit clauses: 1
% 0.13/15.61  %    Negative unit clauses             : 13
% 0.13/15.61  %    Non-unit-clauses                  : 99
% 0.13/15.61  % Current number of unprocessed clauses: 502
% 0.13/15.61  % ...number of literals in the above   : 1096
% 0.13/15.61  % Current number of archived formulas  : 0
% 0.13/15.61  % Current number of archived clauses   : 528
% 0.13/15.61  % Clause-clause subsumption calls (NU) : 36900
% 0.13/15.61  % Rec. Clause-clause subsumption calls : 16850
% 0.13/15.61  % Non-unit clause-clause subsumptions  : 75
% 0.13/15.61  % Unit Clause-clause subsumption calls : 135
% 0.13/15.61  % Rewrite failures with RHS unbound    : 0
% 0.13/15.61  % BW rewrite match attempts            : 73
% 0.13/15.61  % BW rewrite match successes           : 54
% 0.13/15.61  % Condensation attempts                : 0
% 0.13/15.61  % Condensation successes               : 0
% 0.13/15.61  % Termbank termtop insertions          : 25973
% 0.13/15.61  % Search garbage collected termcells   : 934
% 0.13/15.61  
% 0.13/15.61  % -------------------------------------------------
% 0.13/15.61  % User time                : 0.075 s
% 0.13/15.61  % System time              : 0.010 s
% 0.13/15.61  % Total time               : 0.085 s
% 0.13/15.61  % Maximum resident set size: 4844 pages
% 0.13/15.61  
% 0.13/15.61  % -------------------------------------------------
% 0.13/15.61  % User time                : 0.474 s
% 0.13/15.61  % System time              : 0.045 s
% 0.13/15.61  % Total time               : 0.519 s
% 0.13/15.61  % Maximum resident set size: 5120 pages
% 0.13/15.61  % E exiting
%------------------------------------------------------------------------------