↑ Up

E---3.5.1.SAT-Sat.s

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

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

% Result   : Satisfiable 0.14s 0.43s
% Output   : Saturation 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_16ERROR: Could not build tree for root c_0_32ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_31,negated_conjecture,
    ( f(g(X1,X2),w(X1))
    | f(w(X1),g(X1,X2))
    | f(g(X1,X2),X1)
    | f(X2,g(X1,X2))
    | f(g(X1,X2),X2)
    | f(X1,g(X1,X2)) ),
    clause5,
    [final] ).

cnf(c_0_32,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(w(X1),g(X1,X2))
    | ~ f(g(X1,X2),X1)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(X1,g(X1,X2)) ),
    c_0_16,
    [final] ).

cnf(c_0_33,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(w(X1),g(X1,X2))
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | f(g(X1,X2),X1)
    | f(X1,g(X1,X2)) ),
    c_0_17,
    [final] ).

cnf(c_0_34,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(w(X1),g(X1,X2))
    | ~ f(g(X1,X2),X1)
    | ~ f(X1,g(X1,X2))
    | f(X2,g(X1,X2))
    | f(g(X1,X2),X2) ),
    c_0_18,
    [final] ).

cnf(c_0_35,negated_conjecture,
    ( ~ f(g(X1,X2),X1)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(X1,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | f(w(X1),g(X1,X2)) ),
    c_0_19,
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( ~ f(w(X1),g(X1,X2))
    | ~ f(X2,g(X1,X2))
    | ~ f(X1,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | f(g(X1,X2),X1)
    | f(g(X1,X2),X2) ),
    c_0_20,
    [final] ).

cnf(c_0_37,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(X2,g(X1,X2))
    | ~ f(X1,g(X1,X2))
    | f(w(X1),g(X1,X2))
    | f(g(X1,X2),X1)
    | f(g(X1,X2),X2) ),
    c_0_21,
    [final] ).

cnf(c_0_38,negated_conjecture,
    ( ~ f(w(X1),g(X1,X2))
    | ~ f(g(X1,X2),X1)
    | ~ f(X2,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | f(g(X1,X2),X2)
    | f(X1,g(X1,X2)) ),
    c_0_22,
    [final] ).

cnf(c_0_39,negated_conjecture,
    ( ~ f(w(X1),g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(X1,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | f(g(X1,X2),X1)
    | f(X2,g(X1,X2)) ),
    c_0_23,
    [final] ).

cnf(c_0_40,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(g(X1,X2),X1)
    | ~ f(X2,g(X1,X2))
    | f(w(X1),g(X1,X2))
    | f(g(X1,X2),X2)
    | f(X1,g(X1,X2)) ),
    c_0_24,
    [final] ).

cnf(c_0_41,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(g(X1,X2),X2)
    | ~ f(X1,g(X1,X2))
    | f(w(X1),g(X1,X2))
    | f(g(X1,X2),X1)
    | f(X2,g(X1,X2)) ),
    c_0_25,
    [final] ).

cnf(c_0_42,negated_conjecture,
    ( ~ f(w(X1),g(X1,X2))
    | ~ f(g(X1,X2),X1)
    | ~ f(g(X1,X2),X2)
    | f(g(X1,X2),w(X1))
    | f(X2,g(X1,X2))
    | f(X1,g(X1,X2)) ),
    c_0_26,
    [final] ).

cnf(c_0_43,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(g(X1,X2),X1)
    | ~ f(g(X1,X2),X2)
    | f(w(X1),g(X1,X2))
    | f(X2,g(X1,X2))
    | f(X1,g(X1,X2)) ),
    c_0_27,
    [final] ).

cnf(c_0_44,negated_conjecture,
    ( ~ f(g(X1,X2),w(X1))
    | ~ f(w(X1),g(X1,X2))
    | f(g(X1,X2),X1)
    | f(X2,g(X1,X2))
    | f(g(X1,X2),X2)
    | f(X1,g(X1,X2)) ),
    c_0_28,
    [final] ).

cnf(c_0_45,negated_conjecture,
    ( ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | f(g(X1,X2),w(X1))
    | f(w(X1),g(X1,X2))
    | f(g(X1,X2),X1)
    | f(X1,g(X1,X2)) ),
    c_0_29,
    [final] ).

cnf(c_0_46,negated_conjecture,
    ( ~ f(g(X1,X2),X1)
    | ~ f(X1,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | f(w(X1),g(X1,X2))
    | f(X2,g(X1,X2))
    | f(g(X1,X2),X2) ),
    c_0_30,
    [final] ).

cnf(c_0_47,negated_conjecture,
    ( f(g(X1,w(X1)),X1)
    | f(X1,g(X1,w(X1)))
    | f(w(X1),g(X1,w(X1)))
    | f(g(X1,w(X1)),w(X1)) ),
    inference(ef,[status(thm)],[c_0_31]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN348-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 10:51:49 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.43  % Version: 3.5.1
% 0.14/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % Starting sh5l with 300s (1) cores
% 0.14/0.43  % new_bool_3 with pid 2742532 completed with status 1
% 0.14/0.43  % Result found by new_bool_3
% 0.14/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.14/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43  % SubtermCWHack with pid 2742538 completed with status 1
% 0.14/0.43  % Result found by SubtermCWHack
% 0.14/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.14/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43  % Preprocessing time       : 0.001 s
% 0.14/0.43  
% 0.14/0.43  % No proof found!
% 0.14/0.43  % SZS status Satisfiable
% 0.14/0.43  % SZS output start Saturation
% See solution above
% 0.14/0.43  % Parsed axioms                        : 16
% 0.14/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.43  % Initial clauses                      : 16
% 0.14/0.43  % Removed in clause preprocessing      : 0
% 0.14/0.43  % Initial clauses in saturation        : 16
% 0.14/0.43  % Processed clauses                    : 18
% 0.14/0.43  % ...of these trivial                  : 0
% 0.14/0.43  % ...subsumed                          : 1
% 0.14/0.43  % ...remaining for further processing  : 17
% 0.14/0.43  % Other redundant clauses eliminated   : 0
% 0.14/0.43  % Clauses deleted for lack of memory   : 0
% 0.14/0.43  % Backward-subsumed                    : 0
% 0.14/0.43  % Backward-rewritten                   : 0
% 0.14/0.43  % Generated clauses                    : 22
% 0.14/0.43  % ...of the previous two non-redundant : 2
% 0.14/0.43  % ...aggressively subsumed             : 0
% 0.14/0.43  % Contextual simplify-reflections      : 0
% 0.14/0.43  % Paramodulations                      : 20
% 0.14/0.43  % Factorizations                       : 2
% 0.14/0.43  % NegExts                              : 0
% 0.14/0.43  % Equation resolutions                 : 0
% 0.14/0.43  % Disequality decompositions           : 0
% 0.14/0.43  % Total rewrite steps                  : 0
% 0.14/0.43  % ...of those cached                   : 0
% 0.14/0.43  % Propositional unsat checks           : 0
% 0.14/0.43  %    Propositional check models        : 0
% 0.14/0.43  %    Propositional check unsatisfiable : 0
% 0.14/0.43  %    Propositional clauses             : 0
% 0.14/0.43  %    Propositional clauses after purity: 0
% 0.14/0.43  %    Propositional unsat core size     : 0
% 0.14/0.43  %    Propositional preprocessing time  : 0.000
% 0.14/0.43  %    Propositional encoding time       : 0.000
% 0.14/0.43  %    Propositional solver time         : 0.000
% 0.14/0.43  %    Success case prop preproc time    : 0.000
% 0.14/0.43  %    Success case prop encoding time   : 0.000
% 0.14/0.43  %    Success case prop solver time     : 0.000
% 0.14/0.43  % Current number of processed clauses  : 17
% 0.14/0.43  %    Positive orientable unit clauses  : 0
% 0.14/0.43  %    Positive unorientable unit clauses: 0
% 0.14/0.43  %    Negative unit clauses             : 0
% 0.14/0.43  %    Non-unit-clauses                  : 17
% 0.14/0.43  % Current number of unprocessed clauses: 0
% 0.14/0.43  % ...number of literals in the above   : 0
% 0.14/0.43  % Current number of archived formulas  : 0
% 0.14/0.43  % Current number of archived clauses   : 0
% 0.14/0.43  % Clause-clause subsumption calls (NU) : 109
% 0.14/0.43  % Rec. Clause-clause subsumption calls : 1
% 0.14/0.43  % Non-unit clause-clause subsumptions  : 1
% 0.14/0.43  % Unit Clause-clause subsumption calls : 0
% 0.14/0.43  % Rewrite failures with RHS unbound    : 0
% 0.14/0.43  % BW rewrite match attempts            : 0
% 0.14/0.43  % BW rewrite match successes           : 0
% 0.14/0.43  % Condensation attempts                : 0
% 0.14/0.43  % Condensation successes               : 0
% 0.14/0.43  % Termbank termtop insertions          : 2452
% 0.14/0.43  % Search garbage collected termcells   : 53
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.005 s
% 0.14/0.43  % System time              : 0.000 s
% 0.14/0.43  % Total time               : 0.005 s
% 0.14/0.43  % Maximum resident set size: 3604 pages
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.006 s
% 0.14/0.43  % System time              : 0.005 s
% 0.14/0.43  % Total time               : 0.011 s
% 0.14/0.43  % Maximum resident set size: 4864 pages
% 0.14/0.43  % E exiting
%------------------------------------------------------------------------------