↑ 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  : CSR063+4 : 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 : n026.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:18:26 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(query213,conjecture,
    ~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query213) ).

fof(ax3_4028,axiom,
    ! [X1] :
      ~ ( individual(X1)
        & collection(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_4028) ).

fof(ax3_41385,axiom,
    ! [X6,X3] :
      ( disjointwith(X6,X3)
     => collection(X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_41385) ).

fof(ax3_23452,axiom,
    individual(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_23452) ).

fof(c_0_4,negated_conjecture,
    ~ ~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    inference(assume_negation,[status(cth)],[query213]) ).

fof(c_0_5,plain,
    ! [X50] :
      ( ~ individual(X50)
      | ~ collection(X50) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_4028])])]) ).

fof(c_0_6,plain,
    ! [X36,X37] :
      ( collection(X36)
      | ~ disjointwith(X36,X37) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_41385])])]) ).

fof(c_0_7,negated_conjecture,
    disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( ~ individual(X1)
    | ~ collection(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    individual(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(split_conjunct,[status(thm)],[ax3_23452]) ).

cnf(c_0_10,plain,
    ( ~ disjointwith(X1,X2)
    | collection(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ~ collection(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR063+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n026.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 14:44:23 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/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
% 1.49/1.08  % Version: 3.5.1
% 1.49/1.08  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.49/1.08  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/1.08  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.49/1.08  % Starting new_bool_3 with 300s (1) cores
% 1.49/1.08  % Starting new_bool_1 with 300s (1) cores
% 1.49/1.08  % Starting sh5l with 300s (1) cores
% 1.49/1.08  % new_bool_1 with pid 2531133 completed with status 0
% 1.49/1.08  % Result found by new_bool_1
% 1.49/1.08  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.49/1.08  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/1.08  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.49/1.08  % Starting new_bool_3 with 300s (1) cores
% 1.49/1.08  % Starting new_bool_1 with 300s (1) cores
% 1.49/1.08  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.49/1.08  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/1.08  % Search class: FHHSM-FFMM32-SFFFFFNN
% 1.49/1.08  % partial match(1): FGHSM-FFMM32-SFFFFFNN
% 1.49/1.08  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.49/1.08  % Starting SubtermCWHack with 28s (1) cores
% 1.49/1.08  % SubtermCWHack with pid 2531136 completed with status 0
% 1.49/1.08  % Result found by SubtermCWHack
% 1.49/1.08  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.49/1.08  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/1.08  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.49/1.08  % Starting new_bool_3 with 300s (1) cores
% 1.49/1.08  % Starting new_bool_1 with 300s (1) cores
% 1.49/1.08  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.49/1.08  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/1.08  % Search class: FHHSM-FFMM32-SFFFFFNN
% 1.49/1.08  % partial match(1): FGHSM-FFMM32-SFFFFFNN
% 1.49/1.08  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.49/1.08  % Starting SubtermCWHack with 28s (1) cores
% 1.49/1.08  % Preprocessing time       : 0.010 s
% 1.49/1.08  
% 1.49/1.08  % Proof found!
% 1.49/1.08  % SZS status Theorem
% 1.49/1.08  % SZS output start CNFRefutation
% See solution above
% 1.49/1.08  % Parsed axioms                        : 44217
% 1.49/1.08  % Removed by relevancy pruning/SinE    : 44149
% 1.49/1.08  % Initial clauses                      : 68
% 1.49/1.08  % Removed in clause preprocessing      : 1
% 1.49/1.08  % Initial clauses in saturation        : 67
% 1.49/1.08  % Processed clauses                    : 67
% 1.49/1.08  % ...of these trivial                  : 15
% 1.49/1.08  % ...subsumed                          : 12
% 1.49/1.08  % ...remaining for further processing  : 40
% 1.49/1.08  % Other redundant clauses eliminated   : 1
% 1.49/1.08  % Clauses deleted for lack of memory   : 0
% 1.49/1.08  % Backward-subsumed                    : 0
% 1.49/1.08  % Backward-rewritten                   : 1
% 1.49/1.08  % Generated clauses                    : 40
% 1.49/1.08  % ...of the previous two non-redundant : 19
% 1.49/1.08  % ...aggressively subsumed             : 0
% 1.49/1.08  % Contextual simplify-reflections      : 0
% 1.49/1.08  % Paramodulations                      : 39
% 1.49/1.08  % Factorizations                       : 0
% 1.49/1.08  % NegExts                              : 0
% 1.49/1.08  % Equation resolutions                 : 1
% 1.49/1.08  % Disequality decompositions           : 0
% 1.49/1.08  % Total rewrite steps                  : 34
% 1.49/1.08  % ...of those cached                   : 23
% 1.49/1.08  % Propositional unsat checks           : 0
% 1.49/1.08  %    Propositional check models        : 0
% 1.49/1.08  %    Propositional check unsatisfiable : 0
% 1.49/1.08  %    Propositional clauses             : 0
% 1.49/1.08  %    Propositional clauses after purity: 0
% 1.49/1.08  %    Propositional unsat core size     : 0
% 1.49/1.08  %    Propositional preprocessing time  : 0.000
% 1.49/1.08  %    Propositional encoding time       : 0.000
% 1.49/1.08  %    Propositional solver time         : 0.000
% 1.49/1.08  %    Success case prop preproc time    : 0.000
% 1.49/1.08  %    Success case prop encoding time   : 0.000
% 1.49/1.08  %    Success case prop solver time     : 0.000
% 1.49/1.08  % Current number of processed clauses  : 38
% 1.49/1.08  %    Positive orientable unit clauses  : 20
% 1.49/1.08  %    Positive unorientable unit clauses: 0
% 1.49/1.08  %    Negative unit clauses             : 1
% 1.49/1.08  %    Non-unit-clauses                  : 17
% 1.49/1.08  % Current number of unprocessed clauses: 19
% 1.49/1.08  % ...number of literals in the above   : 39
% 1.49/1.08  % Current number of archived formulas  : 0
% 1.49/1.08  % Current number of archived clauses   : 1
% 1.49/1.08  % Clause-clause subsumption calls (NU) : 34
% 1.49/1.08  % Rec. Clause-clause subsumption calls : 34
% 1.49/1.08  % Non-unit clause-clause subsumptions  : 12
% 1.49/1.08  % Unit Clause-clause subsumption calls : 1
% 1.49/1.08  % Rewrite failures with RHS unbound    : 0
% 1.49/1.08  % BW rewrite match attempts            : 1
% 1.49/1.08  % BW rewrite match successes           : 1
% 1.49/1.08  % Condensation attempts                : 0
% 1.49/1.08  % Condensation successes               : 0
% 1.49/1.08  % Termbank termtop insertions          : 295025
% 1.49/1.08  % Search garbage collected termcells   : 157901
% 1.49/1.08  
% 1.49/1.08  % -------------------------------------------------
% 1.49/1.08  % User time                : 0.167 s
% 1.49/1.08  % System time              : 0.101 s
% 1.49/1.08  % Total time               : 0.268 s
% 1.49/1.08  % Maximum resident set size: 84020 pages
% 1.49/1.08  
% 1.49/1.08  % -------------------------------------------------
% 1.49/1.08  % User time                : 0.477 s
% 1.49/1.08  % System time              : 0.133 s
% 1.49/1.08  % Total time               : 0.611 s
% 1.49/1.08  % Maximum resident set size: 38144 pages
% 1.49/1.08  % E exiting
%------------------------------------------------------------------------------