↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : AGT016+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n018.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 11:47:27 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(query_16,conjecture,
    ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_16) ).

fof(deduced_366,axiom,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_366) ).

fof(a2_9,axiom,
    ! [X1] :
      ( ( accept_population(X1,other,n0)
        & accept_population(X1,native,n0)
        & accept_population(X1,muslim,n1)
        & accept_population(X1,christian,n24)
        & accept_population(X1,atheist,n75) )
    <=> accept_city(X1,towna) ),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a2_9) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
    inference(assume_negation,[status(cth)],[query_16]) ).

fof(c_0_4,plain,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(fof_simplification,[status(thm)],[deduced_366]) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_6,plain,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ! [X21] :
      ( ( ~ accept_city(X21,towna)
        | accept_population(X21,other,n0) )
      & ( ~ accept_city(X21,towna)
        | accept_population(X21,native,n0) )
      & ( ~ accept_city(X21,towna)
        | accept_population(X21,muslim,n1) )
      & ( ~ accept_city(X21,towna)
        | accept_population(X21,christian,n24) )
      & ( ~ accept_city(X21,towna)
        | accept_population(X21,atheist,n75) )
      & ( accept_city(X21,towna)
        | ~ accept_population(X21,other,n0)
        | ~ accept_population(X21,native,n0)
        | ~ accept_population(X21,muslim,n1)
        | ~ accept_population(X21,christian,n24)
        | ~ accept_population(X21,atheist,n75) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_9])])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X18,X19] : accept_population(muslimcountrybhumanitarianorganization,X18,X19),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

cnf(c_0_9,plain,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ accept_population(X1,other,n0)
    | ~ accept_population(X1,native,n0)
    | ~ accept_population(X1,muslim,n1)
    | ~ accept_population(X1,christian,n24)
    | ~ accept_population(X1,atheist,n75)
    | accept_city(X1,towna) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    accept_population(muslimcountrybhumanitarianorganization,X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : AGT016+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n018.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 12:51:14 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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
% 0.14/0.48  % Version: 3.5.1
% 0.14/0.48  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.48  % Starting new_bool_3 with 600s (2) cores
% 0.14/0.48  % Starting new_bool_1 with 600s (2) cores
% 0.14/0.48  % Starting sh5l with 300s (1) cores
% 0.14/0.48  % sh5l with pid 1919934 completed with status 0
% 0.14/0.48  % Result found by sh5l
% 0.14/0.48  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.48  % Starting new_bool_3 with 600s (2) cores
% 0.14/0.48  % Starting new_bool_1 with 600s (2) cores
% 0.14/0.48  % Starting sh5l with 300s (1) cores
% 0.14/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.48  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.48  % Search class: FHUNF-FSLM21-MFFFFFNN
% 0.14/0.48  % partial match(2): FHUNF-FFLF21-MFFFFFNN
% 0.14/0.48  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.48  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.48  % SubtermCWHack with pid 1919938 completed with status 0
% 0.14/0.48  % Result found by SubtermCWHack
% 0.14/0.48  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.48  % Starting new_bool_3 with 600s (2) cores
% 0.14/0.48  % Starting new_bool_1 with 600s (2) cores
% 0.14/0.48  % Starting sh5l with 300s (1) cores
% 0.14/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.48  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.48  % Search class: FHUNF-FSLM21-MFFFFFNN
% 0.14/0.48  % partial match(2): FHUNF-FFLF21-MFFFFFNN
% 0.14/0.48  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.48  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.48  % Preprocessing time       : 0.006 s
% 0.14/0.48  
% 0.14/0.48  % Proof found!
% 0.14/0.48  % SZS status Theorem
% 0.14/0.48  % SZS output start CNFRefutation
% See solution above
% 0.14/0.48  % Parsed axioms                        : 923
% 0.14/0.48  % Removed by relevancy pruning/SinE    : 278
% 0.14/0.48  % Initial clauses                      : 669
% 0.14/0.48  % Removed in clause preprocessing      : 0
% 0.14/0.48  % Initial clauses in saturation        : 669
% 0.14/0.48  % Processed clauses                    : 682
% 0.14/0.48  % ...of these trivial                  : 39
% 0.14/0.48  % ...subsumed                          : 0
% 0.14/0.48  % ...remaining for further processing  : 643
% 0.14/0.48  % Other redundant clauses eliminated   : 0
% 0.14/0.48  % Clauses deleted for lack of memory   : 0
% 0.14/0.48  % Backward-subsumed                    : 0
% 0.14/0.48  % Backward-rewritten                   : 14
% 0.14/0.48  % Generated clauses                    : 760
% 0.14/0.48  % ...of the previous two non-redundant : 94
% 0.14/0.48  % ...aggressively subsumed             : 0
% 0.14/0.48  % Contextual simplify-reflections      : 0
% 0.14/0.48  % Paramodulations                      : 760
% 0.14/0.48  % Factorizations                       : 0
% 0.14/0.48  % NegExts                              : 0
% 0.14/0.48  % Equation resolutions                 : 0
% 0.14/0.48  % Disequality decompositions           : 0
% 0.14/0.48  % Total rewrite steps                  : 744
% 0.14/0.48  % ...of those cached                   : 404
% 0.14/0.48  % Propositional unsat checks           : 0
% 0.14/0.48  %    Propositional check models        : 0
% 0.14/0.48  %    Propositional check unsatisfiable : 0
% 0.14/0.48  %    Propositional clauses             : 0
% 0.14/0.48  %    Propositional clauses after purity: 0
% 0.14/0.48  %    Propositional unsat core size     : 0
% 0.14/0.48  %    Propositional preprocessing time  : 0.000
% 0.14/0.48  %    Propositional encoding time       : 0.000
% 0.14/0.48  %    Propositional solver time         : 0.000
% 0.14/0.48  %    Success case prop preproc time    : 0.000
% 0.14/0.48  %    Success case prop encoding time   : 0.000
% 0.14/0.48  %    Success case prop solver time     : 0.000
% 0.14/0.48  % Current number of processed clauses  : 629
% 0.14/0.48  %    Positive orientable unit clauses  : 551
% 0.14/0.48  %    Positive unorientable unit clauses: 0
% 0.14/0.48  %    Negative unit clauses             : 45
% 0.14/0.48  %    Non-unit-clauses                  : 33
% 0.14/0.48  % Current number of unprocessed clauses: 80
% 0.14/0.48  % ...number of literals in the above   : 234
% 0.14/0.48  % Current number of archived formulas  : 0
% 0.14/0.48  % Current number of archived clauses   : 14
% 0.14/0.48  % Clause-clause subsumption calls (NU) : 166
% 0.14/0.48  % Rec. Clause-clause subsumption calls : 79
% 0.14/0.48  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.48  % Unit Clause-clause subsumption calls : 1164
% 0.14/0.48  % Rewrite failures with RHS unbound    : 0
% 0.14/0.48  % BW rewrite match attempts            : 335
% 0.14/0.48  % BW rewrite match successes           : 14
% 0.14/0.48  % Condensation attempts                : 0
% 0.14/0.48  % Condensation successes               : 0
% 0.14/0.48  % Termbank termtop insertions          : 24534
% 0.14/0.48  % Search garbage collected termcells   : 1696
% 0.14/0.48  
% 0.14/0.48  % -------------------------------------------------
% 0.14/0.48  % User time                : 0.029 s
% 0.14/0.48  % System time              : 0.012 s
% 0.14/0.48  % Total time               : 0.041 s
% 0.14/0.48  % Maximum resident set size: 5272 pages
% 0.14/0.48  
% 0.14/0.48  % -------------------------------------------------
% 0.14/0.48  % User time                : 0.041 s
% 0.14/0.48  % System time              : 0.018 s
% 0.14/0.48  % Total time               : 0.059 s
% 0.14/0.48  % Maximum resident set size: 5376 pages
% 0.14/0.48  % E exiting
%------------------------------------------------------------------------------