↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SCT075-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 : n014.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.67s 0.56s
% Output   : CNFRefutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (   7 unt;   5 nHn;  15 RR)
%            Number of literals    :   44 (   9 equ;  22 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-4 aty)
%            Number of variables   :   39 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_mem__def_1,axiom,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_mem__def_0,axiom,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(cls_that_0,axiom,
    ( ~ c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
    | 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_complete__Lin_0,axiom,
    ( X1 = X2
    | c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_complete__Lin_0) ).

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

cnf(cls_complete__Lin_1,axiom,
    ( X1 = X2
    | c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_complete__Lin_1) ).

cnf(c_0_7,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_8,plain,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_9,plain,
    ( ~ c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
    | v_thesis____ ),
    inference(fof_simplification,[status(thm)],[cls_that_0]) ).

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

cnf(c_0_11,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    c_0_7 ).

cnf(c_0_12,plain,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    c_0_8 ).

cnf(c_0_13,plain,
    ( ~ c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
    | v_thesis____ ),
    c_0_9 ).

cnf(c_0_14,negated_conjecture,
    ~ v_thesis____,
    c_0_10 ).

cnf(c_0_15,plain,
    ( ~ c_in(X1,X2,X4)
    | c_in(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,axiom,
    ( X1 = X2
    | c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
    cls_complete__Lin_0 ).

cnf(c_0_17,plain,
    ( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
    | ~ c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
    inference(sr,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,X3)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_20,plain,
    ( ~ c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,axiom,
    ( X1 = X2
    | c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
    cls_complete__Lin_1 ).

cnf(c_0_22,plain,
    v_a____ != v_b____,
    c_0_19 ).

cnf(c_0_23,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SCT075-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.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 04:30:05 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.39  Running first-order theorem proving
% 0.15/0.39  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.67/0.56  % Version: 3.5.1
% 0.67/0.56  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.67/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.67/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.67/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.67/0.56  % Starting sh5l with 300s (1) cores
% 0.67/0.56  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3137834 completed with status 0
% 0.67/0.56  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.67/0.56  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.67/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.67/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.67/0.56  % No SInE strategy applied
% 0.67/0.56  % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.67/0.56  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.67/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.67/0.56  % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.67/0.56  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.67/0.56  % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.67/0.56  % G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with pid 3137845 completed with status 0
% 0.67/0.56  % Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.67/0.56  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.67/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.67/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.67/0.56  % No SInE strategy applied
% 0.67/0.56  % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.67/0.56  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.67/0.56  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.67/0.56  % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.67/0.56  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.67/0.56  % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.67/0.56  % Preprocessing time       : 0.005 s
% 0.67/0.56  % Presaturation interreduction done
% 0.67/0.56  
% 0.67/0.56  % Proof found!
% 0.67/0.56  % SZS status Unsatisfiable
% 0.67/0.56  % SZS output start CNFRefutation
% See solution above
% 0.67/0.56  % Parsed axioms                        : 549
% 0.67/0.56  % Removed by relevancy pruning/SinE    : 0
% 0.67/0.56  % Initial clauses                      : 549
% 0.67/0.56  % Removed in clause preprocessing      : 6
% 0.67/0.56  % Initial clauses in saturation        : 543
% 0.67/0.56  % Processed clauses                    : 1277
% 0.67/0.56  % ...of these trivial                  : 52
% 0.67/0.56  % ...subsumed                          : 280
% 0.67/0.56  % ...remaining for further processing  : 945
% 0.67/0.56  % Other redundant clauses eliminated   : 6
% 0.67/0.56  % Clauses deleted for lack of memory   : 0
% 0.67/0.56  % Backward-subsumed                    : 7
% 0.67/0.56  % Backward-rewritten                   : 12
% 0.67/0.56  % Generated clauses                    : 3401
% 0.67/0.56  % ...of the previous two non-redundant : 2758
% 0.67/0.56  % ...aggressively subsumed             : 0
% 0.67/0.56  % Contextual simplify-reflections      : 0
% 0.67/0.56  % Paramodulations                      : 3392
% 0.67/0.56  % Factorizations                       : 0
% 0.67/0.56  % NegExts                              : 0
% 0.67/0.56  % Equation resolutions                 : 9
% 0.67/0.56  % Disequality decompositions           : 0
% 0.67/0.56  % Total rewrite steps                  : 1580
% 0.67/0.56  % ...of those cached                   : 1055
% 0.67/0.56  % Propositional unsat checks           : 0
% 0.67/0.56  %    Propositional check models        : 0
% 0.67/0.56  %    Propositional check unsatisfiable : 0
% 0.67/0.56  %    Propositional clauses             : 0
% 0.67/0.56  %    Propositional clauses after purity: 0
% 0.67/0.56  %    Propositional unsat core size     : 0
% 0.67/0.56  %    Propositional preprocessing time  : 0.000
% 0.67/0.56  %    Propositional encoding time       : 0.000
% 0.67/0.56  %    Propositional solver time         : 0.000
% 0.67/0.56  %    Success case prop preproc time    : 0.000
% 0.67/0.56  %    Success case prop encoding time   : 0.000
% 0.67/0.56  %    Success case prop solver time     : 0.000
% 0.67/0.56  % Current number of processed clauses  : 453
% 0.67/0.56  %    Positive orientable unit clauses  : 124
% 0.67/0.56  %    Positive unorientable unit clauses: 5
% 0.67/0.56  %    Negative unit clauses             : 29
% 0.67/0.56  %    Non-unit-clauses                  : 295
% 0.67/0.56  % Current number of unprocessed clauses: 2473
% 0.67/0.56  % ...number of literals in the above   : 4638
% 0.67/0.56  % Current number of archived formulas  : 0
% 0.67/0.56  % Current number of archived clauses   : 495
% 0.67/0.56  % Clause-clause subsumption calls (NU) : 47285
% 0.67/0.56  % Rec. Clause-clause subsumption calls : 30070
% 0.67/0.56  % Non-unit clause-clause subsumptions  : 175
% 0.67/0.56  % Unit Clause-clause subsumption calls : 2577
% 0.67/0.56  % Rewrite failures with RHS unbound    : 0
% 0.67/0.56  % BW rewrite match attempts            : 672
% 0.67/0.56  % BW rewrite match successes           : 150
% 0.67/0.56  % Condensation attempts                : 0
% 0.67/0.56  % Condensation successes               : 0
% 0.67/0.56  % Termbank termtop insertions          : 74840
% 0.67/0.56  % Search garbage collected termcells   : 1066
% 0.67/0.56  
% 0.67/0.56  % -------------------------------------------------
% 0.67/0.56  % User time                : 0.094 s
% 0.67/0.56  % System time              : 0.009 s
% 0.67/0.56  % Total time               : 0.104 s
% 0.67/0.56  % Maximum resident set size: 4808 pages
% 0.67/0.56  
% 0.67/0.56  % -------------------------------------------------
% 0.67/0.56  % User time                : 0.238 s
% 0.67/0.56  % System time              : 0.034 s
% 0.67/0.56  % Total time               : 0.273 s
% 0.67/0.56  % Maximum resident set size: 5376 pages
% 0.67/0.57  % E exiting
%------------------------------------------------------------------------------