↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Computer : n013.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:23 PM UTC 2026

% Result   : Unsatisfiable 0.30s 0.63s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  23 unt;   0 nHn;  15 RR)
%            Number of literals    :   23 (  22 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    :   12 (  12 usr;   7 con; 0-4 aty)
%            Number of variables   :   20 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax2_7997,axiom,
    ifeq4(genlmt(X1,X2),true,ifeq4(mtvisible(X1),true,mtvisible(X2),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_7997) ).

cnf(ax2_2388,axiom,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member5_mt) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_2388) ).

cnf(query159,negated_conjecture,
    mtvisible(c_tptpgeo_spindlecollectormt) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query159) ).

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

cnf(ax2_489,axiom,
    ifeq4(mtvisible(c_tptpgeo_member5_mt),true,borderson(c_georegion_l4_x56_y47,c_georegion_l4_x57_y47),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_489) ).

cnf(ax2_7642,axiom,
    ifeq4(borderson(X1,X2),true,borderson(X2,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_7642) ).

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

cnf(query159_1,negated_conjecture,
    ifeq3(borderson(c_georegion_l4_x57_y47,c_georegion_l4_x56_y47),true,a,b) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query159_1) ).

cnf(ifeq_axiom_001,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).

cnf(c_0_9,axiom,
    ifeq4(genlmt(X1,X2),true,ifeq4(mtvisible(X1),true,mtvisible(X2),true),true) = true,
    ax2_7997 ).

cnf(c_0_10,axiom,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member5_mt) = true,
    ax2_2388 ).

cnf(c_0_11,negated_conjecture,
    mtvisible(c_tptpgeo_spindlecollectormt) = true,
    query159 ).

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

cnf(c_0_13,axiom,
    ifeq4(mtvisible(c_tptpgeo_member5_mt),true,borderson(c_georegion_l4_x56_y47,c_georegion_l4_x57_y47),true) = true,
    ax2_489 ).

cnf(c_0_14,plain,
    mtvisible(c_tptpgeo_member5_mt) = true,
    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_12]),c_0_12]) ).

cnf(c_0_15,axiom,
    ifeq4(borderson(X1,X2),true,borderson(X2,X1),true) = true,
    ax2_7642 ).

cnf(c_0_16,plain,
    borderson(c_georegion_l4_x56_y47,c_georegion_l4_x57_y47) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).

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

cnf(c_0_18,negated_conjecture,
    ifeq3(borderson(c_georegion_l4_x57_y47,c_georegion_l4_x56_y47),true,a,b) = b,
    query159_1 ).

cnf(c_0_19,plain,
    borderson(c_georegion_l4_x57_y47,c_georegion_l4_x56_y47) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]) ).

cnf(c_0_20,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    ifeq_axiom_001 ).

cnf(c_0_21,negated_conjecture,
    a != b,
    c_0_17 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR059-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n013.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 14:39:05 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/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.30/0.63  % Version: 3.5.1
% 0.30/0.63  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.30/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.63  % Starting new_bool_3 with 900s (3) cores
% 0.30/0.63  % Starting new_bool_1 with 900s (3) cores
% 0.30/0.63  % Starting sh5l with 300s (1) cores
% 0.30/0.63  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.30/0.63  % new_bool_1 with pid 1007093 completed with status 0
% 0.30/0.63  % Result found by new_bool_1
% 0.30/0.63  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.30/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.63  % Starting new_bool_3 with 900s (3) cores
% 0.30/0.63  % Starting new_bool_1 with 900s (3) cores
% 0.30/0.63  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.63  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.63  % Search class: FUUPM-FFMM32-MFFFFFNN
% 0.30/0.63  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.30/0.63  % Starting SubtermCWHack with 91s (1) cores
% 0.30/0.63  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 541s (1) cores
% 0.30/0.63  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 0.30/0.63  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1007100 completed with status 0
% 0.30/0.63  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.30/0.63  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.30/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.63  % Starting new_bool_3 with 900s (3) cores
% 0.30/0.63  % Starting new_bool_1 with 900s (3) cores
% 0.30/0.63  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.63  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.63  % Search class: FUUPM-FFMM32-MFFFFFNN
% 0.30/0.63  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.30/0.63  % Starting SubtermCWHack with 91s (1) cores
% 0.30/0.63  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 541s (1) cores
% 0.30/0.63  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 0.30/0.63  % Preprocessing time       : 0.007 s
% 0.30/0.63  % Presaturation interreduction done
% 0.30/0.63  
% 0.30/0.63  % Proof found!
% 0.30/0.63  % SZS status Unsatisfiable
% 0.30/0.63  % SZS output start CNFRefutation
% See solution above
% 0.30/0.63  % Parsed axioms                        : 8012
% 0.30/0.63  % Removed by relevancy pruning/SinE    : 7962
% 0.30/0.63  % Initial clauses                      : 50
% 0.30/0.63  % Removed in clause preprocessing      : 0
% 0.30/0.63  % Initial clauses in saturation        : 50
% 0.30/0.63  % Processed clauses                    : 92
% 0.30/0.63  % ...of these trivial                  : 9
% 0.30/0.63  % ...subsumed                          : 0
% 0.30/0.63  % ...remaining for further processing  : 83
% 0.30/0.63  % Other redundant clauses eliminated   : 0
% 0.30/0.63  % Clauses deleted for lack of memory   : 0
% 0.30/0.63  % Backward-subsumed                    : 0
% 0.30/0.63  % Backward-rewritten                   : 2
% 0.30/0.63  % Generated clauses                    : 30
% 0.30/0.63  % ...of the previous two non-redundant : 26
% 0.30/0.63  % ...aggressively subsumed             : 0
% 0.30/0.63  % Contextual simplify-reflections      : 0
% 0.30/0.63  % Paramodulations                      : 30
% 0.30/0.63  % Factorizations                       : 0
% 0.30/0.63  % NegExts                              : 0
% 0.30/0.63  % Equation resolutions                 : 0
% 0.30/0.63  % Disequality decompositions           : 0
% 0.30/0.63  % Total rewrite steps                  : 52
% 0.30/0.63  % ...of those cached                   : 17
% 0.30/0.63  % Propositional unsat checks           : 0
% 0.30/0.63  %    Propositional check models        : 0
% 0.30/0.63  %    Propositional check unsatisfiable : 0
% 0.30/0.63  %    Propositional clauses             : 0
% 0.30/0.63  %    Propositional clauses after purity: 0
% 0.30/0.63  %    Propositional unsat core size     : 0
% 0.30/0.63  %    Propositional preprocessing time  : 0.000
% 0.30/0.63  %    Propositional encoding time       : 0.000
% 0.30/0.63  %    Propositional solver time         : 0.000
% 0.30/0.63  %    Success case prop preproc time    : 0.000
% 0.30/0.63  %    Success case prop encoding time   : 0.000
% 0.30/0.63  %    Success case prop solver time     : 0.000
% 0.30/0.63  % Current number of processed clauses  : 40
% 0.30/0.63  %    Positive orientable unit clauses  : 39
% 0.30/0.63  %    Positive unorientable unit clauses: 0
% 0.30/0.63  %    Negative unit clauses             : 1
% 0.30/0.63  %    Non-unit-clauses                  : 0
% 0.30/0.63  % Current number of unprocessed clauses: 25
% 0.30/0.63  % ...number of literals in the above   : 25
% 0.30/0.63  % Current number of archived formulas  : 0
% 0.30/0.63  % Current number of archived clauses   : 43
% 0.30/0.63  % Clause-clause subsumption calls (NU) : 0
% 0.30/0.63  % Rec. Clause-clause subsumption calls : 0
% 0.30/0.63  % Non-unit clause-clause subsumptions  : 0
% 0.30/0.63  % Unit Clause-clause subsumption calls : 0
% 0.30/0.63  % Rewrite failures with RHS unbound    : 0
% 0.30/0.63  % BW rewrite match attempts            : 27
% 0.30/0.63  % BW rewrite match successes           : 2
% 0.30/0.63  % Condensation attempts                : 0
% 0.30/0.63  % Condensation successes               : 0
% 0.30/0.63  % Termbank termtop insertions          : 59255
% 0.30/0.63  % Search garbage collected termcells   : 23356
% 0.30/0.63  
% 0.30/0.63  % -------------------------------------------------
% 0.30/0.63  % User time                : 0.035 s
% 0.30/0.63  % System time              : 0.030 s
% 0.30/0.63  % Total time               : 0.066 s
% 0.30/0.63  % Maximum resident set size: 19204 pages
% 0.30/0.63  
% 0.30/0.63  % -------------------------------------------------
% 0.30/0.63  % User time                : 0.175 s
% 0.30/0.63  % System time              : 0.057 s
% 0.30/0.63  % Total time               : 0.232 s
% 0.30/0.63  % Maximum resident set size: 10496 pages
% 0.30/0.63  % E exiting
%------------------------------------------------------------------------------