↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n006.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:16:18 PM UTC 2026

% Result   : Unsatisfiable 0.97s 1.78s
% Output   : CNFRefutation 0.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  26 unt;   0 nHn;  12 RR)
%            Number of literals    :   26 (  25 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   5 con; 0-4 aty)
%            Number of variables   :   28 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax3_41385,axiom,
    ifeq4(disjointwith(X1,X2),true,collection(X1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_41385) ).

cnf(query205,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query205) ).

cnf(ifeq_axiom,axiom,
    ifeq4(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(ax3_44179,axiom,
    ifeq4(collection(X1),true,genls(X1,X1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_44179) ).

cnf(ax3_711,axiom,
    ifeq4(genls(X1,X2),true,subsetof(X1,X2),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_711) ).

cnf(ax3_29029,axiom,
    ifeq4(subsetof(X1,X2),true,setorcollection(X2),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_29029) ).

cnf(goal,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(ax3_7665,axiom,
    ifeq2(tuple2(individual(X1),setorcollection(X1)),tuple2(true,true),a,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_7665) ).

cnf(ax3_7910,axiom,
    individual(c_xskijump_thegame) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_7910) ).

cnf(ifeq_axiom_002,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).

cnf(c_0_10,axiom,
    ifeq4(disjointwith(X1,X2),true,collection(X1),true) = true,
    ax3_41385 ).

cnf(c_0_11,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) = true,
    query205 ).

cnf(c_0_12,axiom,
    ifeq4(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_13,axiom,
    ifeq4(collection(X1),true,genls(X1,X1),true) = true,
    ax3_44179 ).

cnf(c_0_14,negated_conjecture,
    collection(c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_15,axiom,
    ifeq4(genls(X1,X2),true,subsetof(X1,X2),true) = true,
    ax3_711 ).

cnf(c_0_16,negated_conjecture,
    genls(c_xskijump_thegame,c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).

cnf(c_0_17,axiom,
    ifeq4(subsetof(X1,X2),true,setorcollection(X2),true) = true,
    ax3_29029 ).

cnf(c_0_18,negated_conjecture,
    subsetof(c_xskijump_thegame,c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    a != b,
    inference(fof_simplification,[status(thm)],[goal]) ).

cnf(c_0_20,axiom,
    ifeq2(tuple2(individual(X1),setorcollection(X1)),tuple2(true,true),a,b) = b,
    ax3_7665 ).

cnf(c_0_21,negated_conjecture,
    setorcollection(c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]) ).

cnf(c_0_22,axiom,
    individual(c_xskijump_thegame) = true,
    ax3_7910 ).

cnf(c_0_23,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    ifeq_axiom_002 ).

cnf(c_0_24,negated_conjecture,
    a != b,
    c_0_19 ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR055-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  % Computer : n006.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Mon Sep 21 14:37:27 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.45  Running first-order theorem proving
% 0.12/0.45  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.97/1.78  % Version: 3.5.1
% 0.97/1.78  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.97/1.78  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/1.78  % Starting new_bool_3 with 900s (3) cores
% 0.97/1.78  % Starting new_bool_1 with 900s (3) cores
% 0.97/1.78  % Starting sh5l with 300s (1) cores
% 0.97/1.78  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.97/1.78  % sh5l with pid 3081418 completed with status 0
% 0.97/1.78  % Result found by sh5l
% 0.97/1.78  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.97/1.78  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/1.78  % Starting new_bool_3 with 900s (3) cores
% 0.97/1.78  % Starting new_bool_1 with 900s (3) cores
% 0.97/1.78  % Starting sh5l with 300s (1) cores
% 0.97/1.78  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.97/1.78  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.97/1.78  % Search class: FUUPM-FSLM31-MFFFFFNN
% 0.97/1.78  % partial match(1): FUUPM-SSLM31-MFFFFFNN
% 0.97/1.78  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.97/1.78  % Starting SubtermCWHack with 31s (1) cores
% 0.97/1.78  % SubtermCWHack with pid 3081424 completed with status 0
% 0.97/1.78  % Result found by SubtermCWHack
% 0.97/1.78  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.97/1.78  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/1.78  % Starting new_bool_3 with 900s (3) cores
% 0.97/1.78  % Starting new_bool_1 with 900s (3) cores
% 0.97/1.78  % Starting sh5l with 300s (1) cores
% 0.97/1.78  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.97/1.78  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.97/1.78  % Search class: FUUPM-FSLM31-MFFFFFNN
% 0.97/1.78  % partial match(1): FUUPM-SSLM31-MFFFFFNN
% 0.97/1.78  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.97/1.78  % Starting SubtermCWHack with 31s (1) cores
% 0.97/1.78  % Preprocessing time       : 0.030 s
% 0.97/1.78  
% 0.97/1.78  % Proof found!
% 0.97/1.78  % SZS status Unsatisfiable
% 0.97/1.78  % SZS output start CNFRefutation
% See solution above
% 0.97/1.79  % Parsed axioms                        : 44219
% 0.97/1.79  % Removed by relevancy pruning/SinE    : 43557
% 0.97/1.79  % Initial clauses                      : 662
% 0.97/1.79  % Removed in clause preprocessing      : 0
% 0.97/1.79  % Initial clauses in saturation        : 662
% 0.97/1.79  % Processed clauses                    : 1551
% 0.97/1.79  % ...of these trivial                  : 279
% 0.97/1.79  % ...subsumed                          : 0
% 0.97/1.79  % ...remaining for further processing  : 1272
% 0.97/1.79  % Other redundant clauses eliminated   : 0
% 0.97/1.79  % Clauses deleted for lack of memory   : 0
% 0.97/1.79  % Backward-subsumed                    : 0
% 0.97/1.79  % Backward-rewritten                   : 0
% 0.97/1.79  % Generated clauses                    : 4277
% 0.97/1.79  % ...of the previous two non-redundant : 2519
% 0.97/1.79  % ...aggressively subsumed             : 0
% 0.97/1.79  % Contextual simplify-reflections      : 0
% 0.97/1.79  % Paramodulations                      : 4277
% 0.97/1.79  % Factorizations                       : 0
% 0.97/1.79  % NegExts                              : 0
% 0.97/1.79  % Equation resolutions                 : 0
% 0.97/1.79  % Disequality decompositions           : 0
% 0.97/1.79  % Total rewrite steps                  : 3916
% 0.97/1.79  % ...of those cached                   : 2470
% 0.97/1.79  % Propositional unsat checks           : 0
% 0.97/1.79  %    Propositional check models        : 0
% 0.97/1.79  %    Propositional check unsatisfiable : 0
% 0.97/1.79  %    Propositional clauses             : 0
% 0.97/1.79  %    Propositional clauses after purity: 0
% 0.97/1.79  %    Propositional unsat core size     : 0
% 0.97/1.79  %    Propositional preprocessing time  : 0.000
% 0.97/1.79  %    Propositional encoding time       : 0.000
% 0.97/1.79  %    Propositional solver time         : 0.000
% 0.97/1.79  %    Success case prop preproc time    : 0.000
% 0.97/1.79  %    Success case prop encoding time   : 0.000
% 0.97/1.79  %    Success case prop solver time     : 0.000
% 0.97/1.79  % Current number of processed clauses  : 1272
% 0.97/1.79  %    Positive orientable unit clauses  : 1271
% 0.97/1.79  %    Positive unorientable unit clauses: 0
% 0.97/1.79  %    Negative unit clauses             : 1
% 0.97/1.79  %    Non-unit-clauses                  : 0
% 0.97/1.79  % Current number of unprocessed clauses: 1608
% 0.97/1.79  % ...number of literals in the above   : 1608
% 0.97/1.79  % Current number of archived formulas  : 0
% 0.97/1.79  % Current number of archived clauses   : 0
% 0.97/1.79  % Clause-clause subsumption calls (NU) : 0
% 0.97/1.79  % Rec. Clause-clause subsumption calls : 0
% 0.97/1.79  % Non-unit clause-clause subsumptions  : 0
% 0.97/1.79  % Unit Clause-clause subsumption calls : 0
% 0.97/1.79  % Rewrite failures with RHS unbound    : 0
% 0.97/1.79  % BW rewrite match attempts            : 683
% 0.97/1.79  % BW rewrite match successes           : 0
% 0.97/1.79  % Condensation attempts                : 0
% 0.97/1.79  % Condensation successes               : 0
% 0.97/1.79  % Termbank termtop insertions          : 399771
% 0.97/1.79  % Search garbage collected termcells   : 124808
% 0.97/1.79  
% 0.97/1.79  % -------------------------------------------------
% 0.97/1.79  % User time                : 0.295 s
% 0.97/1.79  % System time              : 0.196 s
% 0.97/1.79  % Total time               : 0.491 s
% 0.97/1.79  % Maximum resident set size: 80920 pages
% 0.97/1.79  
% 0.97/1.79  % -------------------------------------------------
% 0.97/1.79  % User time                : 1.043 s
% 0.97/1.79  % System time              : 0.238 s
% 0.97/1.79  % Total time               : 1.281 s
% 0.97/1.79  % Maximum resident set size: 34560 pages
% 0.97/1.79  % E exiting
%------------------------------------------------------------------------------