↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWW962+1 : TPTP v9.3.1. Released v7.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 03:11:28 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax84,axiom,
    ! [X14,X15] : constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X14,X15)) = X14,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).

fof(ax82,axiom,
    ! [X9,X10,X11] : tuple_assoc_pair(X9,tuple_assoc_pair(X10,X11)) = tuple_assoc_pair(tuple_assoc_pair(X9,X10),X11),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).

fof(ax144,axiom,
    ! [X96,X97] :
      ( pred_attacker(tuple_assoc_pair(X96,X97))
     => pred_attacker(X97) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax144) ).

fof(co0,conjecture,
    ! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).

fof(ax157,axiom,
    pred_attacker(name_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax157) ).

fof(c_0_5,plain,
    ! [X172,X173] : constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X172,X173)) = X172,
    inference(variable_rename,[status(thm)],[ax84]) ).

fof(c_0_6,plain,
    ! [X163,X164,X165] : tuple_assoc_pair(X163,tuple_assoc_pair(X164,X165)) = tuple_assoc_pair(tuple_assoc_pair(X163,X164),X165),
    inference(variable_rename,[status(thm)],[ax82]) ).

fof(c_0_7,plain,
    ! [X170,X171] :
      ( pred_attacker(X171)
      | ~ pred_attacker(tuple_assoc_pair(X170,X171)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax144])])]) ).

cnf(c_0_8,plain,
    constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X1,X2)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)) = tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
    inference(assume_negation,[status(cth)],[co0]) ).

cnf(c_0_11,plain,
    ( ~ pred_attacker(tuple_assoc_pair(X1,X2))
    | pred_attacker(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    tuple_assoc_pair(X1,X2) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).

fof(c_0_13,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).

cnf(c_0_14,plain,
    ( ~ pred_attacker(X2)
    | pred_attacker(X1) ),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    pred_attacker(name_c),
    inference(split_conjunct,[status(thm)],[ax157]) ).

cnf(c_0_16,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    pred_attacker(X1),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW962+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n014.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 10:20:34 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.14/0.45  % Version: 3.5.1
% 0.14/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45  % Starting sh5l with 300s (1) cores
% 0.14/0.45  % new_bool_3 with pid 3827155 completed with status 0
% 0.14/0.45  % Result found by new_bool_3
% 0.14/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45  % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.14/0.45  % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.14/0.45  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45  % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.45  % SubtermCWHack with pid 3827159 completed with status 0
% 0.14/0.45  % Result found by SubtermCWHack
% 0.14/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45  % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.14/0.45  % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.14/0.45  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45  % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.45  % Preprocessing time       : 0.002 s
% 0.14/0.45  
% 0.14/0.45  % Proof found!
% 0.14/0.45  % SZS status Theorem
% 0.14/0.45  % SZS output start CNFRefutation
% See solution above
% 0.14/0.45  % Parsed axioms                        : 177
% 0.14/0.45  % Removed by relevancy pruning/SinE    : 53
% 0.14/0.45  % Initial clauses                      : 124
% 0.14/0.45  % Removed in clause preprocessing      : 0
% 0.14/0.45  % Initial clauses in saturation        : 124
% 0.14/0.45  % Processed clauses                    : 131
% 0.14/0.45  % ...of these trivial                  : 0
% 0.14/0.45  % ...subsumed                          : 4
% 0.14/0.45  % ...remaining for further processing  : 127
% 0.14/0.45  % Other redundant clauses eliminated   : 0
% 0.14/0.45  % Clauses deleted for lack of memory   : 0
% 0.14/0.45  % Backward-subsumed                    : 24
% 0.14/0.45  % Backward-rewritten                   : 18
% 0.14/0.45  % Generated clauses                    : 33
% 0.14/0.45  % ...of the previous two non-redundant : 24
% 0.14/0.45  % ...aggressively subsumed             : 0
% 0.14/0.45  % Contextual simplify-reflections      : 0
% 0.14/0.45  % Paramodulations                      : 33
% 0.14/0.45  % Factorizations                       : 0
% 0.14/0.45  % NegExts                              : 0
% 0.14/0.45  % Equation resolutions                 : 0
% 0.14/0.45  % Disequality decompositions           : 0
% 0.14/0.45  % Total rewrite steps                  : 25
% 0.14/0.45  % ...of those cached                   : 1
% 0.14/0.45  % Propositional unsat checks           : 0
% 0.14/0.45  %    Propositional check models        : 0
% 0.14/0.45  %    Propositional check unsatisfiable : 0
% 0.14/0.45  %    Propositional clauses             : 0
% 0.14/0.45  %    Propositional clauses after purity: 0
% 0.14/0.45  %    Propositional unsat core size     : 0
% 0.14/0.45  %    Propositional preprocessing time  : 0.000
% 0.14/0.45  %    Propositional encoding time       : 0.000
% 0.14/0.45  %    Propositional solver time         : 0.000
% 0.14/0.45  %    Success case prop preproc time    : 0.000
% 0.14/0.45  %    Success case prop encoding time   : 0.000
% 0.14/0.45  %    Success case prop solver time     : 0.000
% 0.14/0.45  % Current number of processed clauses  : 85
% 0.14/0.45  %    Positive orientable unit clauses  : 7
% 0.14/0.45  %    Positive unorientable unit clauses: 0
% 0.14/0.45  %    Negative unit clauses             : 78
% 0.14/0.45  %    Non-unit-clauses                  : 0
% 0.14/0.45  % Current number of unprocessed clauses: 17
% 0.14/0.45  % ...number of literals in the above   : 33
% 0.14/0.45  % Current number of archived formulas  : 0
% 0.14/0.45  % Current number of archived clauses   : 42
% 0.14/0.45  % Clause-clause subsumption calls (NU) : 533
% 0.14/0.45  % Rec. Clause-clause subsumption calls : 522
% 0.14/0.45  % Non-unit clause-clause subsumptions  : 28
% 0.14/0.45  % Unit Clause-clause subsumption calls : 447
% 0.14/0.45  % Rewrite failures with RHS unbound    : 0
% 0.14/0.45  % BW rewrite match attempts            : 19
% 0.14/0.45  % BW rewrite match successes           : 19
% 0.14/0.45  % Condensation attempts                : 0
% 0.14/0.45  % Condensation successes               : 0
% 0.14/0.45  % Termbank termtop insertions          : 4917
% 0.14/0.45  % Search garbage collected termcells   : 1108
% 0.14/0.45  
% 0.14/0.45  % -------------------------------------------------
% 0.14/0.45  % User time                : 0.005 s
% 0.14/0.45  % System time              : 0.007 s
% 0.14/0.45  % Total time               : 0.013 s
% 0.14/0.45  % Maximum resident set size: 4100 pages
% 0.14/0.45  
% 0.14/0.45  % -------------------------------------------------
% 0.14/0.45  % User time                : 0.007 s
% 0.14/0.45  % System time              : 0.010 s
% 0.14/0.45  % Total time               : 0.017 s
% 0.14/0.45  % Maximum resident set size: 4864 pages
% 0.14/0.45  % E exiting
%------------------------------------------------------------------------------