↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n008.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:19:51 PM UTC 2026

% Result   : Theorem 2.91s 1.51s
% Output   : CNFRefutation 2.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  13 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (  10   ~;   6   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(predefinitionsA8,axiom,
    ! [X1,X2,X3] :
      ( ( p__d__subclass(X2,X3)
        & p__d__subclass(X1,X2) )
     => p__d__subclass(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).

fof(mergeA2519,axiom,
    p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2519) ).

fof(subclassEvent0321,conjecture,
    p__d__subclass(c__Funding,c__SocialInteraction),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclassEvent0321) ).

fof(mergeA2523,axiom,
    p__d__subclass(c__Giving,c__ChangeOfPossession),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2523) ).

fof(mergeA2526,axiom,
    p__d__subclass(c__Funding,c__Giving),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2526) ).

fof(c_0_5,plain,
    ! [X1045,X1046,X1047] :
      ( p__d__subclass(X1045,X1047)
      | ~ p__d__subclass(X1046,X1047)
      | ~ p__d__subclass(X1045,X1046) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA8])])]) ).

cnf(c_0_6,plain,
    ( ~ p__d__subclass(X2,X3)
    | ~ p__d__subclass(X1,X2)
    | p__d__subclass(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_7,plain,
    p__d__subclass(c__ChangeOfPossession,c__SocialInteraction),
    inference(split_conjunct,[status(thm)],[mergeA2519]) ).

fof(c_0_8,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(assume_negation,[status(cth)],[subclassEvent0321]) ).

cnf(c_0_9,plain,
    ( ~ p__d__subclass(X1,c__ChangeOfPossession)
    | p__d__subclass(X1,c__SocialInteraction) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    p__d__subclass(c__Giving,c__ChangeOfPossession),
    inference(split_conjunct,[status(thm)],[mergeA2523]) ).

fof(c_0_11,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    p__d__subclass(c__Giving,c__SocialInteraction),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

fof(c_0_13,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(fof_nnf,[status(thm)],[c_0_11]) ).

cnf(c_0_14,plain,
    ( ~ p__d__subclass(X1,c__Giving)
    | p__d__subclass(X1,c__SocialInteraction) ),
    inference(spm,[status(thm)],[c_0_6,c_0_12]) ).

cnf(c_0_15,plain,
    p__d__subclass(c__Funding,c__Giving),
    inference(split_conjunct,[status(thm)],[mergeA2526]) ).

cnf(c_0_16,negated_conjecture,
    ~ p__d__subclass(c__Funding,c__SocialInteraction),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR256+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n008.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 : Mon Sep 21 15:21:53 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 2.91/1.51  % Version: 3.5.1
% 2.91/1.51  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.91/1.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.91/1.51  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.91/1.51  % Starting new_bool_3 with 300s (1) cores
% 2.91/1.51  % Starting new_bool_1 with 300s (1) cores
% 2.91/1.51  % Starting sh5l with 300s (1) cores
% 2.91/1.51  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1288328 completed with status 0
% 2.91/1.51  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.91/1.51  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.91/1.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.91/1.51  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.91/1.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.91/1.51  % No SInE strategy applied
% 2.91/1.51  % Search class: FGHSS-SMLM31-MFFFFFNN
% 2.91/1.51  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.91/1.51  % Starting SubtermCWHack with 136s (1) cores
% 2.91/1.51  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.91/1.51  % Starting G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 113s (1) cores
% 2.91/1.51  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 2.91/1.51  % Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 2.91/1.51  % G----_0021_C18_F1_SE_CS_SP_S4S with pid 1288350 completed with status 0
% 2.91/1.51  % Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 2.91/1.51  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.91/1.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.91/1.51  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.91/1.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.91/1.51  % No SInE strategy applied
% 2.91/1.51  % Search class: FGHSS-SMLM31-MFFFFFNN
% 2.91/1.51  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.91/1.51  % Starting SubtermCWHack with 136s (1) cores
% 2.91/1.51  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.91/1.51  % Starting G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 113s (1) cores
% 2.91/1.51  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 2.91/1.51  % Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 2.91/1.51  % Preprocessing time       : 0.150 s
% 2.91/1.51  
% 2.91/1.51  % Proof found!
% 2.91/1.51  % SZS status Theorem
% 2.91/1.51  % SZS output start CNFRefutation
% See solution above
% 2.91/1.51  % Parsed axioms                        : 7433
% 2.91/1.51  % Removed by relevancy pruning/SinE    : 0
% 2.91/1.51  % Initial clauses                      : 10860
% 2.91/1.51  % Removed in clause preprocessing      : 20
% 2.91/1.51  % Initial clauses in saturation        : 10840
% 2.91/1.51  % Processed clauses                    : 433
% 2.91/1.51  % ...of these trivial                  : 0
% 2.91/1.51  % ...subsumed                          : 0
% 2.91/1.51  % ...remaining for further processing  : 433
% 2.91/1.51  % Other redundant clauses eliminated   : 0
% 2.91/1.51  % Clauses deleted for lack of memory   : 0
% 2.91/1.51  % Backward-subsumed                    : 0
% 2.91/1.51  % Backward-rewritten                   : 0
% 2.91/1.51  % Generated clauses                    : 858
% 2.91/1.51  % ...of the previous two non-redundant : 836
% 2.91/1.51  % ...aggressively subsumed             : 0
% 2.91/1.51  % Contextual simplify-reflections      : 0
% 2.91/1.51  % Paramodulations                      : 858
% 2.91/1.51  % Factorizations                       : 0
% 2.91/1.51  % NegExts                              : 0
% 2.91/1.51  % Equation resolutions                 : 0
% 2.91/1.51  % Disequality decompositions           : 0
% 2.91/1.51  % Total rewrite steps                  : 19
% 2.91/1.51  % ...of those cached                   : 0
% 2.91/1.51  % Propositional unsat checks           : 0
% 2.91/1.51  %    Propositional check models        : 0
% 2.91/1.51  %    Propositional check unsatisfiable : 0
% 2.91/1.51  %    Propositional clauses             : 0
% 2.91/1.51  %    Propositional clauses after purity: 0
% 2.91/1.51  %    Propositional unsat core size     : 0
% 2.91/1.51  %    Propositional preprocessing time  : 0.000
% 2.91/1.51  %    Propositional encoding time       : 0.000
% 2.91/1.51  %    Propositional solver time         : 0.000
% 2.91/1.51  %    Success case prop preproc time    : 0.000
% 2.91/1.51  %    Success case prop encoding time   : 0.000
% 2.91/1.51  %    Success case prop solver time     : 0.000
% 2.91/1.51  % Current number of processed clauses  : 433
% 2.91/1.51  %    Positive orientable unit clauses  : 409
% 2.91/1.51  %    Positive unorientable unit clauses: 0
% 2.91/1.51  %    Negative unit clauses             : 2
% 2.91/1.51  %    Non-unit-clauses                  : 22
% 2.91/1.51  % Current number of unprocessed clauses: 11243
% 2.91/1.51  % ...number of literals in the above   : 26002
% 2.91/1.51  % Current number of archived formulas  : 0
% 2.91/1.51  % Current number of archived clauses   : 0
% 2.91/1.51  % Clause-clause subsumption calls (NU) : 158
% 2.91/1.51  % Rec. Clause-clause subsumption calls : 158
% 2.91/1.51  % Non-unit clause-clause subsumptions  : 0
% 2.91/1.51  % Unit Clause-clause subsumption calls : 3383
% 2.91/1.51  % Rewrite failures with RHS unbound    : 0
% 2.91/1.51  % BW rewrite match attempts            : 1
% 2.91/1.51  % BW rewrite match successes           : 0
% 2.91/1.51  % Condensation attempts                : 0
% 2.91/1.51  % Condensation successes               : 0
% 2.91/1.51  % Termbank termtop insertions          : 543659
% 2.91/1.51  % Search garbage collected termcells   : 89321
% 2.91/1.51  
% 2.91/1.51  % -------------------------------------------------
% 2.91/1.51  % User time                : 0.714 s
% 2.91/1.51  % System time              : 0.108 s
% 2.91/1.51  % Total time               : 0.822 s
% 2.91/1.51  % Maximum resident set size: 32472 pages
% 2.91/1.51  
% 2.91/1.51  % -------------------------------------------------
% 2.91/1.51  % User time                : 1.483 s
% 2.91/1.51  % System time              : 0.390 s
% 2.91/1.51  % Total time               : 1.873 s
% 2.91/1.51  % Maximum resident set size: 13056 pages
% 2.91/1.51  % E exiting
%------------------------------------------------------------------------------