↑ 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  : COL042-3 : TPTP v9.3.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:09:52 PM UTC 2026

% Result   : Unsatisfiable 8.34s 1.72s
% Output   : CNFRefutation 8.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   17 (  14 unt;   0 nHn;   9 RR)
%            Number of literals    :   20 (  13 equ;   8 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(w1_definition,axiom,
    apply(apply(w1,X1),X2) = apply(apply(X2,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w1_definition) ).

cnf(b_definition,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).

cnf(prove_strong_fixed_point,negated_conjecture,
    ~ fixed_point(apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_strong_fixed_point) ).

cnf(strong_fixed_point,axiom,
    ( apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt))
    | fixed_point(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',strong_fixed_point) ).

cnf(c_0_4,axiom,
    apply(apply(w1,X1),X2) = apply(apply(X2,X1),X1),
    w1_definition ).

cnf(c_0_5,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    b_definition ).

cnf(c_0_6,negated_conjecture,
    ~ fixed_point(apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b))),
    inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).

cnf(c_0_7,plain,
    ( apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt))
    | fixed_point(X1) ),
    inference(fof_simplification,[status(thm)],[strong_fixed_point]) ).

cnf(c_0_8,plain,
    apply(apply(w1,X1),apply(apply(b,X2),X3)) = apply(apply(X2,apply(X3,X1)),X1),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ fixed_point(apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b))),
    c_0_6 ).

cnf(c_0_10,plain,
    ( apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt))
    | fixed_point(X1) ),
    c_0_7 ).

cnf(c_0_11,plain,
    apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(X3,X1),X1)),
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    apply(fixed_pt,apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,fixed_pt))))) != apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,fixed_pt)))),
    inference(rw,[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_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]) ).

cnf(c_0_13,plain,
    apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(w1,X1),X3)),
    inference(spm,[status(thm)],[c_0_11,c_0_4]) ).

cnf(c_0_14,negated_conjecture,
    apply(fixed_pt,apply(apply(w1,apply(apply(b,apply(b,fixed_pt)),w1)),w1)) != apply(apply(w1,apply(apply(b,apply(b,fixed_pt)),w1)),w1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_8]) ).

cnf(c_0_15,plain,
    apply(X1,apply(apply(w1,apply(apply(b,apply(b,X1)),X2)),X2)) = apply(apply(w1,apply(apply(b,apply(b,X1)),X2)),w1),
    inference(spm,[status(thm)],[c_0_4,c_0_13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL042-3 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n011.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 14:06:12 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/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
% 8.34/1.72  % Version: 3.5.1
% 8.34/1.72  % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.34/1.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.34/1.72  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.34/1.72  % Starting new_bool_3 with 300s (1) cores
% 8.34/1.72  % Starting new_bool_1 with 300s (1) cores
% 8.34/1.72  % Starting sh5l with 300s (1) cores
% 8.34/1.72  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2106713 completed with status 0
% 8.34/1.72  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.34/1.72  % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.34/1.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.34/1.72  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.34/1.72  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.34/1.72  % No SInE strategy applied
% 8.34/1.72  % Search class: FHUSS-FFSF22-MFFFFFNN
% 8.34/1.72  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.34/1.72  % Starting SubtermCWHack with 136s (1) cores
% 8.34/1.72  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.34/1.72  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 8.34/1.72  % Starting new_bool_3 with 136s (1) cores
% 8.34/1.72  % Starting new_bool_1 with 136s (1) cores
% 8.34/1.72  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2106721 completed with status 0
% 8.34/1.72  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 8.34/1.72  % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.34/1.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.34/1.72  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.34/1.72  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.34/1.72  % No SInE strategy applied
% 8.34/1.72  % Search class: FHUSS-FFSF22-MFFFFFNN
% 8.34/1.72  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.34/1.72  % Starting SubtermCWHack with 136s (1) cores
% 8.34/1.72  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.34/1.72  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 8.34/1.72  % Preprocessing time       : 0.001 s
% 8.34/1.72  % Presaturation interreduction done
% 8.34/1.72  
% 8.34/1.72  % Proof found!
% 8.34/1.72  % SZS status Unsatisfiable
% 8.34/1.72  % SZS output start CNFRefutation
% See solution above
% 8.34/1.72  % Parsed axioms                        : 4
% 8.34/1.72  % Removed by relevancy pruning/SinE    : 0
% 8.34/1.72  % Initial clauses                      : 4
% 8.34/1.72  % Removed in clause preprocessing      : 0
% 8.34/1.72  % Initial clauses in saturation        : 4
% 8.34/1.72  % Processed clauses                    : 932
% 8.34/1.72  % ...of these trivial                  : 360
% 8.34/1.72  % ...subsumed                          : 155
% 8.34/1.72  % ...remaining for further processing  : 417
% 8.34/1.72  % Other redundant clauses eliminated   : 0
% 8.34/1.72  % Clauses deleted for lack of memory   : 0
% 8.34/1.72  % Backward-subsumed                    : 2
% 8.34/1.72  % Backward-rewritten                   : 60
% 8.34/1.72  % Generated clauses                    : 34034
% 8.34/1.72  % ...of the previous two non-redundant : 32665
% 8.34/1.72  % ...aggressively subsumed             : 0
% 8.34/1.72  % Contextual simplify-reflections      : 0
% 8.34/1.72  % Paramodulations                      : 34034
% 8.34/1.72  % Factorizations                       : 0
% 8.34/1.72  % NegExts                              : 0
% 8.34/1.72  % Equation resolutions                 : 0
% 8.34/1.72  % Disequality decompositions           : 0
% 8.34/1.72  % Total rewrite steps                  : 32083
% 8.34/1.72  % ...of those cached                   : 24982
% 8.34/1.72  % Propositional unsat checks           : 0
% 8.34/1.72  %    Propositional check models        : 0
% 8.34/1.72  %    Propositional check unsatisfiable : 0
% 8.34/1.72  %    Propositional clauses             : 0
% 8.34/1.72  %    Propositional clauses after purity: 0
% 8.34/1.72  %    Propositional unsat core size     : 0
% 8.34/1.72  %    Propositional preprocessing time  : 0.000
% 8.34/1.72  %    Propositional encoding time       : 0.000
% 8.34/1.72  %    Propositional solver time         : 0.000
% 8.34/1.72  %    Success case prop preproc time    : 0.000
% 8.34/1.72  %    Success case prop encoding time   : 0.000
% 8.34/1.72  %    Success case prop solver time     : 0.000
% 8.34/1.72  % Current number of processed clauses  : 351
% 8.34/1.72  %    Positive orientable unit clauses  : 304
% 8.34/1.72  %    Positive unorientable unit clauses: 45
% 8.34/1.72  %    Negative unit clauses             : 1
% 8.34/1.72  %    Non-unit-clauses                  : 1
% 8.34/1.72  % Current number of unprocessed clauses: 31625
% 8.34/1.72  % ...number of literals in the above   : 31625
% 8.34/1.72  % Current number of archived formulas  : 0
% 8.34/1.72  % Current number of archived clauses   : 66
% 8.34/1.72  % Clause-clause subsumption calls (NU) : 0
% 8.34/1.72  % Rec. Clause-clause subsumption calls : 0
% 8.34/1.72  % Non-unit clause-clause subsumptions  : 0
% 8.34/1.72  % Unit Clause-clause subsumption calls : 4522
% 8.34/1.72  % Rewrite failures with RHS unbound    : 0
% 8.34/1.72  % BW rewrite match attempts            : 10542
% 8.34/1.72  % BW rewrite match successes           : 357
% 8.34/1.72  % Condensation attempts                : 0
% 8.34/1.72  % Condensation successes               : 0
% 8.34/1.72  % Termbank termtop insertions          : 1338880
% 8.34/1.72  % Search garbage collected termcells   : 5
% 8.34/1.72  
% 8.34/1.72  % -------------------------------------------------
% 8.34/1.72  % User time                : 0.906 s
% 8.34/1.72  % System time              : 0.036 s
% 8.34/1.72  % Total time               : 0.942 s
% 8.34/1.72  % Maximum resident set size: 3636 pages
% 8.34/1.72  
% 8.34/1.72  % -------------------------------------------------
% 8.34/1.72  % User time                : 5.428 s
% 8.34/1.72  % System time              : 0.261 s
% 8.34/1.72  % Total time               : 5.689 s
% 8.34/1.72  % Maximum resident set size: 4864 pages
% 8.34/1.72  % E exiting
%------------------------------------------------------------------------------