TSTP Solution File: CSR256+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CSR256+1 : TPTP v8.2.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 19:20:50 EDT 2024

% Result   : Theorem 3.17s 1.28s
% Output   : CNFRefutation 3.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  12 unt;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (   9   ~;   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(X1,X2)
        & p__d__subclass(X2,X3) )
     => p__d__subclass(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).

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

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

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

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

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

cnf(c_0_6,plain,
    ( p__d__subclass(X1,X3)
    | ~ p__d__subclass(X1,X2)
    | ~ p__d__subclass(X2,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]) ).

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : CSR256+1 : TPTP v8.2.0. Released v7.3.0.
% 0.09/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n014.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Sun May 19 01:40:07 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.15/0.40  Running first-order model finding
% 0.15/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.28  # Version: 3.1.0
% 3.17/1.28  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.17/1.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.28  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.17/1.28  # Starting new_bool_3 with 300s (1) cores
% 3.17/1.28  # Starting new_bool_1 with 300s (1) cores
% 3.17/1.28  # Starting sh5l with 300s (1) cores
% 3.17/1.28  # sh5l with pid 6297 completed with status 0
% 3.17/1.28  # Result found by sh5l
% 3.17/1.28  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.17/1.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.28  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.17/1.28  # Starting new_bool_3 with 300s (1) cores
% 3.17/1.28  # Starting new_bool_1 with 300s (1) cores
% 3.17/1.28  # Starting sh5l with 300s (1) cores
% 3.17/1.28  # SinE strategy is gf500_gu_R04_F100_L20000
% 3.17/1.28  # Search class: FGHSF-SMLM31-SFFFFFNN
% 3.17/1.28  # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 3.17/1.28  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.17/1.28  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 3.17/1.28  # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6303 completed with status 0
% 3.17/1.28  # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.17/1.28  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.17/1.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.28  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.17/1.28  # Starting new_bool_3 with 300s (1) cores
% 3.17/1.28  # Starting new_bool_1 with 300s (1) cores
% 3.17/1.28  # Starting sh5l with 300s (1) cores
% 3.17/1.28  # SinE strategy is gf500_gu_R04_F100_L20000
% 3.17/1.28  # Search class: FGHSF-SMLM31-SFFFFFNN
% 3.17/1.28  # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 3.17/1.28  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.17/1.28  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 3.17/1.28  # Preprocessing time       : 0.130 s
% 3.17/1.28  # Presaturation interreduction done
% 3.17/1.28  
% 3.17/1.28  # Proof found!
% 3.17/1.28  # SZS status Theorem
% 3.17/1.28  # SZS output start CNFRefutation
% See solution above
% 3.17/1.28  # Parsed axioms                        : 7433
% 3.17/1.28  # Removed by relevancy pruning/SinE    : 6004
% 3.17/1.28  # Initial clauses                      : 2420
% 3.17/1.28  # Removed in clause preprocessing      : 2
% 3.17/1.28  # Initial clauses in saturation        : 2418
% 3.17/1.28  # Processed clauses                    : 3756
% 3.17/1.28  # ...of these trivial                  : 5
% 3.17/1.28  # ...subsumed                          : 3
% 3.17/1.28  # ...remaining for further processing  : 3748
% 3.17/1.28  # Other redundant clauses eliminated   : 61
% 3.17/1.28  # Clauses deleted for lack of memory   : 0
% 3.17/1.28  # Backward-subsumed                    : 0
% 3.17/1.28  # Backward-rewritten                   : 0
% 3.17/1.28  # Generated clauses                    : 1517
% 3.17/1.28  # ...of the previous two non-redundant : 1487
% 3.17/1.28  # ...aggressively subsumed             : 0
% 3.17/1.28  # Contextual simplify-reflections      : 696
% 3.17/1.28  # Paramodulations                      : 1461
% 3.17/1.28  # Factorizations                       : 0
% 3.17/1.28  # NegExts                              : 0
% 3.17/1.28  # Equation resolutions                 : 61
% 3.17/1.28  # Disequality decompositions           : 0
% 3.17/1.28  # Total rewrite steps                  : 26
% 3.17/1.28  # ...of those cached                   : 1
% 3.17/1.28  # Propositional unsat checks           : 0
% 3.17/1.28  #    Propositional check models        : 0
% 3.17/1.28  #    Propositional check unsatisfiable : 0
% 3.17/1.28  #    Propositional clauses             : 0
% 3.17/1.28  #    Propositional clauses after purity: 0
% 3.17/1.28  #    Propositional unsat core size     : 0
% 3.17/1.28  #    Propositional preprocessing time  : 0.000
% 3.17/1.28  #    Propositional encoding time       : 0.000
% 3.17/1.28  #    Propositional solver time         : 0.000
% 3.17/1.28  #    Success case prop preproc time    : 0.000
% 3.17/1.28  #    Success case prop encoding time   : 0.000
% 3.17/1.28  #    Success case prop solver time     : 0.000
% 3.17/1.28  # Current number of processed clauses  : 1277
% 3.17/1.28  #    Positive orientable unit clauses  : 775
% 3.17/1.28  #    Positive unorientable unit clauses: 0
% 3.17/1.28  #    Negative unit clauses             : 4
% 3.17/1.28  #    Non-unit-clauses                  : 498
% 3.17/1.28  # Current number of unprocessed clauses: 2561
% 3.17/1.28  # ...number of literals in the above   : 6461
% 3.17/1.28  # Current number of archived formulas  : 0
% 3.17/1.28  # Current number of archived clauses   : 2415
% 3.17/1.28  # Clause-clause subsumption calls (NU) : 1349333
% 3.17/1.28  # Rec. Clause-clause subsumption calls : 548817
% 3.17/1.28  # Non-unit clause-clause subsumptions  : 699
% 3.17/1.28  # Unit Clause-clause subsumption calls : 31835
% 3.17/1.28  # Rewrite failures with RHS unbound    : 0
% 3.17/1.28  # BW rewrite match attempts            : 15
% 3.17/1.28  # BW rewrite match successes           : 0
% 3.17/1.28  # Condensation attempts                : 0
% 3.17/1.28  # Condensation successes               : 0
% 3.17/1.28  # Termbank termtop insertions          : 214008
% 3.17/1.28  # Search garbage collected termcells   : 56591
% 3.17/1.28  
% 3.17/1.28  # -------------------------------------------------
% 3.17/1.28  # User time                : 0.651 s
% 3.17/1.28  # System time              : 0.044 s
% 3.17/1.28  # Total time               : 0.695 s
% 3.17/1.28  # Maximum resident set size: 20976 pages
% 3.17/1.28  
% 3.17/1.28  # -------------------------------------------------
% 3.17/1.28  # User time                : 0.790 s
% 3.17/1.28  # System time              : 0.056 s
% 3.17/1.28  # Total time               : 0.846 s
% 3.17/1.28  # Maximum resident set size: 9660 pages
% 3.17/1.28  % E---3.1 exiting
%------------------------------------------------------------------------------