↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n004.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 01:01:02 PM UTC 2026

% Result   : Theorem 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   40 (   7 unt;   0 def)
%            Number of atoms       :  174 (   0 equ)
%            Maximal formula atoms :   24 (   4 avg)
%            Number of connectives :  224 (  90   ~;  76   |;  48   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   14 (  13 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   32 (   2 sgn  21   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
    ( cowlThing(iV3102)
    & cC14(iV3102)
    & cC64(iV3102)
    & cC28(iV3102)
    & cC44(iV3102)
    & cC30(iV3102)
    & cC46(iV3102)
    & cC216(iV3102)
    & ! [X1] :
        ( xsd_string(X1)
      <=> ~ xsd_integer(X1) )
    & ! [X1] :
        ( ~ cowlNothing(X1)
        & cowlThing(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).

fof(axiom_0,axiom,
    ! [X1] :
      ( ~ cowlNothing(X1)
      & cowlThing(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).

fof(axiom_1,axiom,
    ! [X1] :
      ( xsd_string(X1)
    <=> ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(axiom_65,axiom,
    ! [X1] :
      ( cC216(X1)
    <=> ( cC64(X1)
        & ~ cC214(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_65) ).

fof(axiom_70,axiom,
    ! [X1] :
      ( cC30(X1)
    <=> ( cC28(X1)
        & cC14(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_70) ).

fof(axiom_78,axiom,
    ! [X1] :
      ( cC46(X1)
    <=> ( cC44(X1)
        & cC30(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_78) ).

fof(axiom_107,axiom,
    ! [X1] :
      ( cTEST(X1)
    <=> ( cC46(X1)
        & cC216(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_107) ).

fof(axiom_108,axiom,
    cTEST(iV3102),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_108) ).

fof(c_0_8,negated_conjecture,
    ~ ( cowlThing(iV3102)
      & cC14(iV3102)
      & cC64(iV3102)
      & cC28(iV3102)
      & cC44(iV3102)
      & cC30(iV3102)
      & cC46(iV3102)
      & cC216(iV3102)
      & ! [X1] :
          ( xsd_string(X1)
        <=> ~ xsd_integer(X1) )
      & ! [X1] :
          ( ~ cowlNothing(X1)
          & cowlThing(X1) ) ),
    inference(assume_negation,[status(cth)],[the_axiom]) ).

fof(c_0_9,negated_conjecture,
    ~ ( cowlThing(iV3102)
      & cC14(iV3102)
      & cC64(iV3102)
      & cC28(iV3102)
      & cC44(iV3102)
      & cC30(iV3102)
      & cC46(iV3102)
      & cC216(iV3102)
      & ! [X1] :
          ( xsd_string(X1)
        <=> ~ xsd_integer(X1) )
      & ! [X1] :
          ( ~ cowlNothing(X1)
          & cowlThing(X1) ) ),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_10,plain,
    ! [X1] :
      ( ~ cowlNothing(X1)
      & cowlThing(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_0]) ).

fof(c_0_11,plain,
    ! [X1] :
      ( xsd_string(X1)
    <=> ~ xsd_integer(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

fof(c_0_12,plain,
    ! [X1] :
      ( cC216(X1)
    <=> ( cC64(X1)
        & ~ cC214(X1) ) ),
    inference(fof_simplification,[status(thm)],[axiom_65]) ).

fof(c_0_13,negated_conjecture,
    ( ( ~ cowlThing(iV3102)
      | ~ cC14(iV3102)
      | ~ cC64(iV3102)
      | ~ cC28(iV3102)
      | ~ cC44(iV3102)
      | ~ cC30(iV3102)
      | ~ cC46(iV3102)
      | ~ cC216(iV3102)
      | cowlNothing(esk1_0)
      | ~ cowlThing(esk1_0)
      | ~ xsd_integer(esk2_0)
      | xsd_string(esk2_0) )
    & ( ~ cowlThing(iV3102)
      | ~ cC14(iV3102)
      | ~ cC64(iV3102)
      | ~ cC28(iV3102)
      | ~ cC44(iV3102)
      | ~ cC30(iV3102)
      | ~ cC46(iV3102)
      | ~ cC216(iV3102)
      | cowlNothing(esk1_0)
      | ~ cowlThing(esk1_0)
      | xsd_integer(esk2_0)
      | ~ xsd_string(esk2_0) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

fof(c_0_14,plain,
    ! [X5] :
      ( ~ cowlNothing(X5)
      & cowlThing(X5) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).

fof(c_0_15,plain,
    ! [X14] :
      ( ( xsd_string(X14)
        | xsd_integer(X14) )
      & ( ~ xsd_integer(X14)
        | ~ xsd_string(X14) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).

fof(c_0_16,plain,
    ! [X7] :
      ( ( cC30(X7)
        | ~ cC28(X7)
        | ~ cC14(X7) )
      & ( ~ cC30(X7)
        | cC28(X7) )
      & ( ~ cC30(X7)
        | cC14(X7) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_70])])])]) ).

fof(c_0_17,plain,
    ! [X8] :
      ( ( cC216(X8)
        | ~ cC64(X8)
        | cC214(X8) )
      & ( ~ cC216(X8)
        | cC64(X8) )
      & ( ~ cC216(X8)
        | ~ cC214(X8) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

fof(c_0_18,plain,
    ! [X12] :
      ( ( cC46(X12)
        | ~ cC44(X12)
        | ~ cC30(X12) )
      & ( ~ cC46(X12)
        | cC44(X12) )
      & ( ~ cC46(X12)
        | cC30(X12) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_78])])])]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ cowlThing(iV3102)
    | ~ cC14(iV3102)
    | ~ cC64(iV3102)
    | ~ cC28(iV3102)
    | ~ cC44(iV3102)
    | ~ cC30(iV3102)
    | ~ cC46(iV3102)
    | ~ cC216(iV3102)
    | ~ cowlThing(esk1_0)
    | ~ xsd_integer(esk2_0)
    | cowlNothing(esk1_0)
    | xsd_string(esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    cowlThing(X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,plain,
    ( ~ cC30(X1)
    | cC14(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    ( ~ cC216(X1)
    | cC64(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_25,plain,
    ( ~ cC30(X1)
    | cC28(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,plain,
    ( ~ cC46(X1)
    | cC30(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,plain,
    ( ~ cC46(X1)
    | cC44(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ cowlThing(iV3102)
    | ~ cC14(iV3102)
    | ~ cC64(iV3102)
    | ~ cC28(iV3102)
    | ~ cC44(iV3102)
    | ~ cC30(iV3102)
    | ~ cC46(iV3102)
    | ~ cC216(iV3102)
    | ~ cowlThing(esk1_0)
    | ~ xsd_string(esk2_0)
    | cowlNothing(esk1_0)
    | xsd_integer(esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ cC216(iV3102)
    | ~ cC46(iV3102)
    | xsd_string(esk2_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20])]),c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27]) ).

fof(c_0_30,plain,
    ! [X13] :
      ( ( cTEST(X13)
        | ~ cC46(X13)
        | ~ cC216(X13) )
      & ( ~ cTEST(X13)
        | cC46(X13) )
      & ( ~ cTEST(X13)
        | cC216(X13) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_107])])])]) ).

cnf(c_0_31,plain,
    ( ~ xsd_integer(X1)
    | ~ xsd_string(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ cC216(iV3102)
    | ~ cC46(iV3102)
    | xsd_integer(esk2_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_20]),c_0_20])]),c_0_21]),c_0_29]),c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27]) ).

cnf(c_0_33,plain,
    ( ~ cTEST(X1)
    | cC216(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_34,plain,
    cTEST(iV3102),
    inference(split_conjunct,[status(thm)],[axiom_108]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ cC216(iV3102)
    | ~ cC46(iV3102) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29]) ).

cnf(c_0_36,plain,
    cC216(iV3102),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,plain,
    ( ~ cTEST(X1)
    | cC46(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,negated_conjecture,
    ~ cC46(iV3102),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).

cnf(c_0_39,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_38]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS149+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n004.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 20 22:54:51 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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.16/0.45  % Version: 3.5.1
% 0.16/0.45  % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.16/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.16/0.45  % Starting new_bool_3 with 600s (2) cores
% 0.16/0.45  % Starting new_bool_1 with 600s (2) cores
% 0.16/0.45  % Starting sh5l with 300s (1) cores
% 0.16/0.45  % new_bool_3 with pid 1673111 completed with status 0
% 0.16/0.45  % Result found by new_bool_3
% 0.16/0.45  % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.16/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.16/0.45  % Starting new_bool_3 with 600s (2) cores
% 0.16/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  % Search class: FGHNF-FFMS11-SFFFFFNN
% 0.16/0.45  % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.45  % Starting SubtermCWHack with 61s (1) cores
% 0.16/0.45  % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.16/0.45  % SAT001_MinMin_p005000_rr_RG with pid 1673119 completed with status 0
% 0.16/0.45  % Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45  % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.16/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.16/0.45  % Starting new_bool_3 with 600s (2) cores
% 0.16/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  % Search class: FGHNF-FFMS11-SFFFFFNN
% 0.16/0.45  % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.45  % Starting SubtermCWHack with 61s (1) cores
% 0.16/0.45  % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.16/0.45  % Preprocessing time       : 0.001 s
% 0.16/0.45  % Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  % Proof found!
% 0.16/0.45  % SZS status Theorem
% 0.16/0.45  % SZS output start CNFRefutation
% See solution above
% 0.16/0.45  % Parsed axioms                        : 126
% 0.16/0.45  % Removed by relevancy pruning/SinE    : 88
% 0.16/0.45  % Initial clauses                      : 79
% 0.16/0.45  % Removed in clause preprocessing      : 0
% 0.16/0.45  % Initial clauses in saturation        : 79
% 0.16/0.45  % Processed clauses                    : 117
% 0.16/0.45  % ...of these trivial                  : 0
% 0.16/0.45  % ...subsumed                          : 0
% 0.16/0.45  % ...remaining for further processing  : 117
% 0.16/0.45  % Other redundant clauses eliminated   : 0
% 0.16/0.45  % Clauses deleted for lack of memory   : 0
% 0.16/0.45  % Backward-subsumed                    : 2
% 0.16/0.45  % Backward-rewritten                   : 2
% 0.16/0.45  % Generated clauses                    : 4
% 0.16/0.45  % ...of the previous two non-redundant : 3
% 0.16/0.45  % ...aggressively subsumed             : 0
% 0.16/0.45  % Contextual simplify-reflections      : 13
% 0.16/0.45  % Paramodulations                      : 4
% 0.16/0.45  % Factorizations                       : 0
% 0.16/0.45  % NegExts                              : 0
% 0.16/0.45  % Equation resolutions                 : 0
% 0.16/0.45  % Disequality decompositions           : 0
% 0.16/0.45  % Total rewrite steps                  : 6
% 0.16/0.45  % ...of those cached                   : 3
% 0.16/0.45  % Propositional unsat checks           : 0
% 0.16/0.45  %    Propositional check models        : 0
% 0.16/0.45  %    Propositional check unsatisfiable : 0
% 0.16/0.45  %    Propositional clauses             : 0
% 0.16/0.45  %    Propositional clauses after purity: 0
% 0.16/0.45  %    Propositional unsat core size     : 0
% 0.16/0.45  %    Propositional preprocessing time  : 0.000
% 0.16/0.45  %    Propositional encoding time       : 0.000
% 0.16/0.45  %    Propositional solver time         : 0.000
% 0.16/0.45  %    Success case prop preproc time    : 0.000
% 0.16/0.45  %    Success case prop encoding time   : 0.000
% 0.16/0.45  %    Success case prop solver time     : 0.000
% 0.16/0.45  % Current number of processed clauses  : 35
% 0.16/0.45  %    Positive orientable unit clauses  : 4
% 0.16/0.45  %    Positive unorientable unit clauses: 0
% 0.16/0.45  %    Negative unit clauses             : 11
% 0.16/0.45  %    Non-unit-clauses                  : 20
% 0.16/0.45  % Current number of unprocessed clauses: 43
% 0.16/0.45  % ...number of literals in the above   : 105
% 0.16/0.45  % Current number of archived formulas  : 0
% 0.16/0.45  % Current number of archived clauses   : 82
% 0.16/0.45  % Clause-clause subsumption calls (NU) : 633
% 0.16/0.45  % Rec. Clause-clause subsumption calls : 486
% 0.16/0.45  % Non-unit clause-clause subsumptions  : 15
% 0.16/0.45  % Unit Clause-clause subsumption calls : 46
% 0.16/0.45  % Rewrite failures with RHS unbound    : 0
% 0.16/0.45  % BW rewrite match attempts            : 2
% 0.16/0.45  % BW rewrite match successes           : 2
% 0.16/0.45  % Condensation attempts                : 0
% 0.16/0.45  % Condensation successes               : 0
% 0.16/0.45  % Termbank termtop insertions          : 5440
% 0.16/0.45  % Search garbage collected termcells   : 1409
% 0.16/0.45  
% 0.16/0.45  % -------------------------------------------------
% 0.16/0.45  % User time                : 0.007 s
% 0.16/0.45  % System time              : 0.003 s
% 0.16/0.45  % Total time               : 0.010 s
% 0.16/0.45  % Maximum resident set size: 4024 pages
% 0.16/0.45  
% 0.16/0.45  % -------------------------------------------------
% 0.16/0.45  % User time                : 0.015 s
% 0.16/0.45  % System time              : 0.005 s
% 0.16/0.45  % Total time               : 0.020 s
% 0.16/0.45  % Maximum resident set size: 4608 pages
% 0.16/0.45  % E exiting
%------------------------------------------------------------------------------