↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n020.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 12:11:51 PM UTC 2026

% Result   : Theorem 0.43s 0.60s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  24 unt;   0 typ;   0 def)
%            Number of atoms       :   64 (  22 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   42 (  18   ~;  14   |;   6   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   79 (   0 sgn  77   !;   2   ?;  79   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    vTable: $tType ).

tff(decl_sort2,type,
    vAttrL: $tType ).

tff(decl_sort3,type,
    vTType: $tType ).

tff(decl_sort4,type,
    vRawTable: $tType ).

tff(decl_sort5,type,
    vPred: $tType ).

tff(decl_62,type,
    vtable: ( vRawTable * vAttrL ) > vTable ).

tff(decl_64,type,
    vmatchingAttrL: ( vAttrL * vTType ) > $o ).

tff(decl_71,type,
    vgetRaw: vTable > vRawTable ).

tff(decl_78,type,
    vwelltypedRawtable: ( vRawTable * vTType ) > $o ).

tff(decl_82,type,
    vwelltypedtable: ( vTable * vTType ) > $o ).

tff(decl_87,type,
    vfilterTable: ( vPred * vTable ) > vTable ).

tff(decl_89,type,
    vgetAttrL: vTable > vAttrL ).

tff(decl_102,type,
    vfilterRows: ( vPred * ( vAttrL * vRawTable ) ) > vRawTable ).

tff(decl_128,type,
    esk1_0: vTType ).

tff(decl_129,type,
    esk2_0: vTable ).

tff(decl_130,type,
    esk3_0: vPred ).

tff(decl_257,type,
    esk130_1: vTable > vAttrL ).

tff(decl_258,type,
    esk131_1: vTable > vRawTable ).

tff('getRaw-INV',axiom,
    ! [X5: vTable] :
    ? [X66: vAttrL,X67: vRawTable] :
      ( ( vgetRaw(X5) = X67 )
      & ( X5 = vtable(X66,X67) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getRaw-INV') ).

tff('getAttrL-0',axiom,
    ! [X68: vAttrL,X69: vRawTable] : ( vgetAttrL(vtable(X68,X69)) = X68 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getAttrL-0') ).

tff('getRaw-0',axiom,
    ! [X65: vAttrL,X52: vRawTable] : ( vgetRaw(vtable(X65,X52)) = X52 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getRaw-0') ).

tff('filterTable-0',axiom,
    ! [X68: vAttrL,X52: vRawTable,X287: vPred] : ( vfilterTable(vtable(X68,X52),X287) = vtable(X68,vfilterRows(X52,X68,X287)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','filterTable-0') ).

tff('welltypedtable-0',axiom,
    ! [X54: vTType,X68: vAttrL,X101: vRawTable] :
      ( vwelltypedtable(X54,vtable(X68,X101))
    <=> ( vwelltypedRawtable(X54,X101)
        & vmatchingAttrL(X54,X68) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','welltypedtable-0') ).

tff(filterPreservesType,conjecture,
    ! [X54: vTType,X53: vTable,X287: vPred] :
      ( vwelltypedtable(X54,X53)
     => vwelltypedtable(X54,vfilterTable(X53,X287)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',filterPreservesType) ).

tff(filterRowsPreservesTable,axiom,
    ! [X54: vTType,X52: vRawTable,X68: vAttrL,X287: vPred] :
      ( vwelltypedRawtable(X54,X52)
     => vwelltypedRawtable(X54,vfilterRows(X52,X68,X287)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',filterRowsPreservesTable) ).

tff(c_0_7,plain,
    ! [X850: vTable] :
      ( ( vgetRaw(X850) = esk131_1(X850) )
      & ( X850 = vtable(esk130_1(X850),esk131_1(X850)) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['getRaw-INV'])]) ).

tff(c_0_8,plain,
    ! [X859: vAttrL,X860: vRawTable] : ( vgetAttrL(vtable(X859,X860)) = X859 ),
    inference(variable_rename,[status(thm)],['getAttrL-0']) ).

tcf(c_0_9,plain,
    ! [X5: vTable] : X5 = vtable(esk130_1(X5),esk131_1(X5)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tcf(c_0_10,plain,
    ! [X5: vTable] : vgetRaw(X5) = esk131_1(X5),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tcf(c_0_11,plain,
    ! [X27: vRawTable,X2: vAttrL] : vgetAttrL(vtable(X2,X27)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

tcf(c_0_12,plain,
    ! [X5: vTable] : vtable(esk130_1(X5),vgetRaw(X5)) = X5,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

tff(c_0_13,plain,
    ! [X848: vAttrL,X849: vRawTable] : ( vgetRaw(vtable(X848,X849)) = X849 ),
    inference(variable_rename,[status(thm)],['getRaw-0']) ).

tff(c_0_14,plain,
    ! [X482: vAttrL,X483: vRawTable,X484: vPred] : ( vfilterTable(vtable(X482,X483),X484) = vtable(X482,vfilterRows(X483,X482,X484)) ),
    inference(variable_rename,[status(thm)],['filterTable-0']) ).

tff(c_0_15,plain,
    ! [X463: vTType,X464: vAttrL,X465: vRawTable] :
      ( ( vwelltypedtable(X463,vtable(X464,X465))
        | ~ vwelltypedRawtable(X463,X465)
        | ~ vmatchingAttrL(X463,X464) )
      & ( ~ vwelltypedtable(X463,vtable(X464,X465))
        | vwelltypedRawtable(X463,X465) )
      & ( ~ vwelltypedtable(X463,vtable(X464,X465))
        | vmatchingAttrL(X463,X464) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['welltypedtable-0'])])])]) ).

tcf(c_0_16,plain,
    ! [X5: vTable] : esk130_1(X5) = vgetAttrL(X5),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

tff(c_0_17,negated_conjecture,
    ~ ! [X54: vTType,X53: vTable,X287: vPred] :
        ( vwelltypedtable(X54,X53)
       => vwelltypedtable(X54,vfilterTable(X53,X287)) ),
    inference(assume_negation,[status(cth)],[filterPreservesType]) ).

tcf(c_0_18,plain,
    ! [X2: vAttrL,X27: vRawTable] : vgetRaw(vtable(X2,X27)) = X27,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

tcf(c_0_19,plain,
    ! [X2: vAttrL,X27: vRawTable,X8: vPred] : vfilterTable(vtable(X2,X27),X8) = vtable(X2,vfilterRows(X27,X2,X8)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

tcf(c_0_20,plain,
    ! [X2: vAttrL,X18: vTType,X27: vRawTable] :
      ( ~ vwelltypedtable(X18,vtable(X2,X27))
      | vmatchingAttrL(X18,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

tcf(c_0_21,plain,
    ! [X5: vTable] : vtable(vgetAttrL(X5),vgetRaw(X5)) = X5,
    inference(rw,[status(thm)],[c_0_12,c_0_16]) ).

tff(c_0_22,negated_conjecture,
    ( ~ vwelltypedtable(esk1_0,vfilterTable(esk2_0,esk3_0))
    & vwelltypedtable(esk1_0,esk2_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).

tcf(c_0_23,plain,
    ! [X2: vAttrL,X18: vTType,X27: vRawTable] :
      ( ~ vwelltypedRawtable(X18,X27)
      | ~ vmatchingAttrL(X18,X2)
      | vwelltypedtable(X18,vtable(X2,X27)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

tcf(c_0_24,plain,
    ! [X2: vAttrL,X27: vRawTable,X8: vPred] : vgetRaw(vfilterTable(vtable(X2,X27),X8)) = vfilterRows(X27,X2,X8),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

tcf(c_0_25,plain,
    ! [X27: vRawTable,X8: vPred,X2: vAttrL] : vgetAttrL(vfilterTable(vtable(X2,X27),X8)) = X2,
    inference(spm,[status(thm)],[c_0_11,c_0_19]) ).

tcf(c_0_26,plain,
    ! [X18: vTType,X5: vTable] :
      ( ~ vwelltypedtable(X18,X5)
      | vmatchingAttrL(X18,vgetAttrL(X5)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

tcf(c_0_27,negated_conjecture,
    vwelltypedtable(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

tcf(c_0_28,plain,
    ! [X2: vAttrL,X18: vTType,X27: vRawTable] :
      ( ~ vwelltypedtable(X18,vtable(X2,X27))
      | vwelltypedRawtable(X18,X27) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

tcf(c_0_29,negated_conjecture,
    ~ vwelltypedtable(esk1_0,vfilterTable(esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

tcf(c_0_30,plain,
    ! [X18: vTType,X5: vTable] :
      ( ~ vmatchingAttrL(X18,vgetAttrL(X5))
      | ~ vwelltypedRawtable(X18,vgetRaw(X5))
      | vwelltypedtable(X18,X5) ),
    inference(spm,[status(thm)],[c_0_23,c_0_21]) ).

tcf(c_0_31,plain,
    ! [X5: vTable,X8: vPred] : vgetRaw(vfilterTable(X5,X8)) = vfilterRows(vgetRaw(X5),vgetAttrL(X5),X8),
    inference(spm,[status(thm)],[c_0_24,c_0_21]) ).

tcf(c_0_32,plain,
    ! [X8: vPred,X5: vTable] : vgetAttrL(vfilterTable(X5,X8)) = vgetAttrL(X5),
    inference(spm,[status(thm)],[c_0_25,c_0_21]) ).

tcf(c_0_33,negated_conjecture,
    vmatchingAttrL(esk1_0,vgetAttrL(esk2_0)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

tff(c_0_34,plain,
    ! [X523: vTType,X524: vRawTable,X525: vAttrL,X526: vPred] :
      ( vwelltypedRawtable(X523,vfilterRows(X524,X525,X526))
      | ~ vwelltypedRawtable(X523,X524) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[filterRowsPreservesTable])])]) ).

tcf(c_0_35,plain,
    ! [X18: vTType,X5: vTable] :
      ( ~ vwelltypedtable(X18,X5)
      | vwelltypedRawtable(X18,vgetRaw(X5)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_21]) ).

tcf(c_0_36,negated_conjecture,
    ~ vwelltypedRawtable(esk1_0,vfilterRows(vgetRaw(esk2_0),vgetAttrL(esk2_0),esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).

tcf(c_0_37,plain,
    ! [X2: vAttrL,X8: vPred,X18: vTType,X27: vRawTable] :
      ( ~ vwelltypedRawtable(X18,X27)
      | vwelltypedRawtable(X18,vfilterRows(X27,X2,X8)) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

tcf(c_0_38,negated_conjecture,
    vwelltypedRawtable(esk1_0,vgetRaw(esk2_0)),
    inference(spm,[status(thm)],[c_0_35,c_0_27]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM281_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 14:23:17 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.42  Running first-order theorem proving
% 0.15/0.42  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.43/0.60  % Version: 3.5.1
% 0.43/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.43/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.43/0.60  % Starting sh5l with 300s (1) cores
% 0.43/0.60  % new_bool_1 with pid 3165657 completed with status 0
% 0.43/0.60  % Result found by new_bool_1
% 0.43/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.43/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.43/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.43/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.60  % Search class: FGHSM-SMLS32-DFFFFFNN
% 0.43/0.60  % partial match(1): FGHSM-SMLM32-DFFFFFNN
% 0.43/0.60  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.60  % Starting SubtermCWHack with 28s (1) cores
% 0.43/0.60  % SubtermCWHack with pid 3165660 completed with status 0
% 0.43/0.60  % Result found by SubtermCWHack
% 0.43/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.43/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.43/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.43/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.60  % Search class: FGHSM-SMLS32-DFFFFFNN
% 0.43/0.60  % partial match(1): FGHSM-SMLM32-DFFFFFNN
% 0.43/0.60  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.60  % Starting SubtermCWHack with 28s (1) cores
% 0.43/0.60  % Preprocessing time       : 0.025 s
% 0.43/0.60  
% 0.43/0.60  % Proof found!
% 0.43/0.60  % SZS status Theorem
% 0.43/0.60  % SZS output start CNFRefutation
% See solution above
% 0.43/0.60  % Parsed axioms                        : 409
% 0.43/0.60  % Removed by relevancy pruning/SinE    : 256
% 0.43/0.60  % Initial clauses                      : 1475
% 0.43/0.60  % Removed in clause preprocessing      : 0
% 0.43/0.60  % Initial clauses in saturation        : 1475
% 0.43/0.60  % Processed clauses                    : 527
% 0.43/0.60  % ...of these trivial                  : 23
% 0.43/0.60  % ...subsumed                          : 172
% 0.43/0.60  % ...remaining for further processing  : 332
% 0.43/0.60  % Other redundant clauses eliminated   : 150
% 0.43/0.60  % Clauses deleted for lack of memory   : 0
% 0.43/0.60  % Backward-subsumed                    : 2
% 0.43/0.60  % Backward-rewritten                   : 10
% 0.43/0.60  % Generated clauses                    : 1055
% 0.43/0.60  % ...of the previous two non-redundant : 700
% 0.43/0.60  % ...aggressively subsumed             : 0
% 0.43/0.60  % Contextual simplify-reflections      : 0
% 0.43/0.60  % Paramodulations                      : 877
% 0.43/0.60  % Factorizations                       : 0
% 0.43/0.60  % NegExts                              : 0
% 0.43/0.60  % Equation resolutions                 : 178
% 0.43/0.60  % Disequality decompositions           : 0
% 0.43/0.60  % Total rewrite steps                  : 305
% 0.43/0.60  % ...of those cached                   : 233
% 0.43/0.60  % Propositional unsat checks           : 0
% 0.43/0.60  %    Propositional check models        : 0
% 0.43/0.60  %    Propositional check unsatisfiable : 0
% 0.43/0.60  %    Propositional clauses             : 0
% 0.43/0.60  %    Propositional clauses after purity: 0
% 0.43/0.60  %    Propositional unsat core size     : 0
% 0.43/0.60  %    Propositional preprocessing time  : 0.000
% 0.43/0.60  %    Propositional encoding time       : 0.000
% 0.43/0.60  %    Propositional solver time         : 0.000
% 0.43/0.60  %    Success case prop preproc time    : 0.000
% 0.43/0.60  %    Success case prop encoding time   : 0.000
% 0.43/0.60  %    Success case prop solver time     : 0.000
% 0.43/0.60  % Current number of processed clauses  : 319
% 0.43/0.60  %    Positive orientable unit clauses  : 68
% 0.43/0.60  %    Positive unorientable unit clauses: 4
% 0.43/0.60  %    Negative unit clauses             : 24
% 0.43/0.60  %    Non-unit-clauses                  : 223
% 0.43/0.60  % Current number of unprocessed clauses: 1631
% 0.43/0.60  % ...number of literals in the above   : 6100
% 0.43/0.60  % Current number of archived formulas  : 0
% 0.43/0.60  % Current number of archived clauses   : 12
% 0.43/0.60  % Clause-clause subsumption calls (NU) : 11160
% 0.43/0.60  % Rec. Clause-clause subsumption calls : 10064
% 0.43/0.60  % Non-unit clause-clause subsumptions  : 156
% 0.43/0.60  % Unit Clause-clause subsumption calls : 764
% 0.43/0.60  % Rewrite failures with RHS unbound    : 16
% 0.43/0.60  % BW rewrite match attempts            : 12
% 0.43/0.60  % BW rewrite match successes           : 12
% 0.43/0.60  % Condensation attempts                : 0
% 0.43/0.60  % Condensation successes               : 0
% 0.43/0.60  % Termbank termtop insertions          : 67514
% 0.43/0.60  % Search garbage collected termcells   : 12481
% 0.43/0.60  
% 0.43/0.60  % -------------------------------------------------
% 0.43/0.60  % User time                : 0.127 s
% 0.43/0.60  % System time              : 0.018 s
% 0.43/0.60  % Total time               : 0.145 s
% 0.43/0.60  % Maximum resident set size: 7248 pages
% 0.43/0.60  
% 0.43/0.60  % -------------------------------------------------
% 0.43/0.60  % User time                : 0.140 s
% 0.43/0.60  % System time              : 0.025 s
% 0.43/0.60  % Total time               : 0.166 s
% 0.43/0.60  % Maximum resident set size: 5632 pages
% 0.43/0.60  % E exiting
%------------------------------------------------------------------------------