↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR056+3 : TPTP v9.3.1. Released v3.4.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 12:16:19 PM UTC 2026

% Result   : Theorem 0.30s 0.72s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (  10 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   42 (  19   ~;  14   |;   3   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   17 (   1 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query156,conjecture,
    ? [X23] :
      ( mtvisible(c_tptp_member3717_mt)
     => tptpofobject(c_tptpartsupplies,X23) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query156) ).

fof(ax2_842,axiom,
    ! [X2] :
      ( ( supplies(X2)
        & mtvisible(c_tptp_member3717_mt) )
     => tptpofobject(X2,f_tptpquantityfn_17(n_385)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_842) ).

fof(ax2_1480,axiom,
    ! [X1] :
      ( artsupplies(X1)
     => supplies(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1480) ).

fof(ax2_1986,axiom,
    ( mtvisible(c_cyclistsmt)
   => artsupplies(c_tptpartsupplies) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1986) ).

fof(ax2_7997,axiom,
    ! [X21,X22] :
      ( ( genlmt(X21,X22)
        & mtvisible(X21) )
     => mtvisible(X22) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).

fof(ax2_856,axiom,
    genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_856) ).

fof(ax2_4288,axiom,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).

fof(c_0_7,negated_conjecture,
    ~ ? [X23] :
        ( mtvisible(c_tptp_member3717_mt)
       => tptpofobject(c_tptpartsupplies,X23) ),
    inference(assume_negation,[status(cth)],[query156]) ).

fof(c_0_8,plain,
    ! [X31] :
      ( tptpofobject(X31,f_tptpquantityfn_17(n_385))
      | ~ supplies(X31)
      | ~ mtvisible(c_tptp_member3717_mt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_842])])]) ).

fof(c_0_9,negated_conjecture,
    ! [X24] :
      ( ~ tptpofobject(c_tptpartsupplies,X24)
      & mtvisible(c_tptp_member3717_mt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_10,plain,
    ( ~ supplies(X1)
    | ~ mtvisible(c_tptp_member3717_mt)
    | tptpofobject(X1,f_tptpquantityfn_17(n_385)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    mtvisible(c_tptp_member3717_mt),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X62] :
      ( supplies(X62)
      | ~ artsupplies(X62) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1480])])]) ).

fof(c_0_13,plain,
    ( artsupplies(c_tptpartsupplies)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1986])]) ).

cnf(c_0_14,negated_conjecture,
    ~ tptpofobject(c_tptpartsupplies,X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( ~ supplies(X1)
    | tptpofobject(X1,f_tptpquantityfn_17(n_385)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_16,plain,
    ( ~ artsupplies(X1)
    | supplies(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | artsupplies(c_tptpartsupplies) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,plain,
    ! [X29,X30] :
      ( mtvisible(X30)
      | ~ genlmt(X29,X30)
      | ~ mtvisible(X29) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).

cnf(c_0_19,negated_conjecture,
    ~ supplies(c_tptpartsupplies),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | supplies(c_tptpartsupplies) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    ( ~ genlmt(X1,X2)
    | ~ mtvisible(X1)
    | mtvisible(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,plain,
    genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax2_856]) ).

cnf(c_0_23,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax2_4288]) ).

cnf(c_0_24,negated_conjecture,
    ~ mtvisible(c_cyclistsmt),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_11])]) ).

cnf(c_0_26,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_24]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR056+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 14:38:05 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/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.30/0.72  % Version: 3.5.1
% 0.30/0.72  % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.30/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.72  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.30/0.72  % Starting new_bool_3 with 300s (1) cores
% 0.30/0.72  % Starting new_bool_1 with 300s (1) cores
% 0.30/0.72  % Starting sh5l with 300s (1) cores
% 0.30/0.72  % sh5l with pid 124648 completed with status 0
% 0.30/0.72  % Result found by sh5l
% 0.30/0.72  % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.30/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.72  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.30/0.72  % Starting new_bool_3 with 300s (1) cores
% 0.30/0.72  % Starting new_bool_1 with 300s (1) cores
% 0.30/0.72  % Starting sh5l with 300s (1) cores
% 0.30/0.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.72  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.72  % Search class: FHHNM-FSLM31-MFFFFFNN
% 0.30/0.72  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.30/0.72  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.72  % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.72  % SubtermCWHack with pid 124653 completed with status 0
% 0.30/0.72  % Result found by SubtermCWHack
% 0.30/0.72  % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.30/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.72  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.30/0.72  % Starting new_bool_3 with 300s (1) cores
% 0.30/0.72  % Starting new_bool_1 with 300s (1) cores
% 0.30/0.72  % Starting sh5l with 300s (1) cores
% 0.30/0.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.72  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.72  % Search class: FHHNM-FSLM31-MFFFFFNN
% 0.30/0.72  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.30/0.72  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.72  % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.72  % Preprocessing time       : 0.018 s
% 0.30/0.72  
% 0.30/0.72  % Proof found!
% 0.30/0.72  % SZS status Theorem
% 0.30/0.72  % SZS output start CNFRefutation
% See solution above
% 0.30/0.72  % Parsed axioms                        : 8006
% 0.30/0.72  % Removed by relevancy pruning/SinE    : 7287
% 0.30/0.72  % Initial clauses                      : 720
% 0.30/0.72  % Removed in clause preprocessing      : 0
% 0.30/0.72  % Initial clauses in saturation        : 720
% 0.30/0.72  % Processed clauses                    : 1000
% 0.30/0.72  % ...of these trivial                  : 102
% 0.30/0.72  % ...subsumed                          : 63
% 0.30/0.72  % ...remaining for further processing  : 834
% 0.30/0.72  % Other redundant clauses eliminated   : 0
% 0.30/0.72  % Clauses deleted for lack of memory   : 0
% 0.30/0.72  % Backward-subsumed                    : 8
% 0.30/0.72  % Backward-rewritten                   : 7
% 0.30/0.72  % Generated clauses                    : 1212
% 0.30/0.72  % ...of the previous two non-redundant : 820
% 0.30/0.72  % ...aggressively subsumed             : 0
% 0.30/0.72  % Contextual simplify-reflections      : 0
% 0.30/0.72  % Paramodulations                      : 1212
% 0.30/0.72  % Factorizations                       : 0
% 0.30/0.72  % NegExts                              : 0
% 0.30/0.72  % Equation resolutions                 : 0
% 0.30/0.72  % Disequality decompositions           : 0
% 0.30/0.72  % Total rewrite steps                  : 459
% 0.30/0.72  % ...of those cached                   : 251
% 0.30/0.72  % Propositional unsat checks           : 0
% 0.30/0.72  %    Propositional check models        : 0
% 0.30/0.72  %    Propositional check unsatisfiable : 0
% 0.30/0.72  %    Propositional clauses             : 0
% 0.30/0.72  %    Propositional clauses after purity: 0
% 0.30/0.72  %    Propositional unsat core size     : 0
% 0.30/0.72  %    Propositional preprocessing time  : 0.000
% 0.30/0.72  %    Propositional encoding time       : 0.000
% 0.30/0.72  %    Propositional solver time         : 0.000
% 0.30/0.72  %    Success case prop preproc time    : 0.000
% 0.30/0.72  %    Success case prop encoding time   : 0.000
% 0.30/0.72  %    Success case prop solver time     : 0.000
% 0.30/0.72  % Current number of processed clauses  : 819
% 0.30/0.72  %    Positive orientable unit clauses  : 476
% 0.30/0.72  %    Positive unorientable unit clauses: 0
% 0.30/0.72  %    Negative unit clauses             : 53
% 0.30/0.72  %    Non-unit-clauses                  : 290
% 0.30/0.72  % Current number of unprocessed clauses: 535
% 0.30/0.72  % ...number of literals in the above   : 918
% 0.30/0.72  % Current number of archived formulas  : 0
% 0.30/0.72  % Current number of archived clauses   : 15
% 0.30/0.72  % Clause-clause subsumption calls (NU) : 10765
% 0.30/0.72  % Rec. Clause-clause subsumption calls : 10139
% 0.30/0.72  % Non-unit clause-clause subsumptions  : 63
% 0.30/0.72  % Unit Clause-clause subsumption calls : 3969
% 0.30/0.72  % Rewrite failures with RHS unbound    : 0
% 0.30/0.72  % BW rewrite match attempts            : 1
% 0.30/0.72  % BW rewrite match successes           : 1
% 0.30/0.72  % Condensation attempts                : 0
% 0.30/0.72  % Condensation successes               : 0
% 0.30/0.72  % Termbank termtop insertions          : 88229
% 0.30/0.72  % Search garbage collected termcells   : 32021
% 0.30/0.72  
% 0.30/0.72  % -------------------------------------------------
% 0.30/0.72  % User time                : 0.092 s
% 0.30/0.72  % System time              : 0.048 s
% 0.30/0.72  % Total time               : 0.140 s
% 0.30/0.72  % Maximum resident set size: 20596 pages
% 0.30/0.72  
% 0.30/0.72  % -------------------------------------------------
% 0.30/0.72  % User time                : 0.214 s
% 0.30/0.72  % System time              : 0.062 s
% 0.30/0.72  % Total time               : 0.276 s
% 0.30/0.72  % Maximum resident set size: 11264 pages
% 0.30/0.72  % E exiting
%------------------------------------------------------------------------------