↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n018.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:11:02 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
tcf(c_0_12,plain,
    ! [X1: state,X4: label,X2: state] :
      ( ~ labels(X4,X2)
      | ~ has(X1,goto(X4))
      | succeeds(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]),
    [final] ).

tcf(c_0_13,hypothesis,
    labels(loop,p3),
    inference(split_conjunct,[status(thm)],[label_state_3]),
    [final] ).

tcf(c_0_15,plain,
    ! [X1: state,X5: boolean,X2: state] :
      ( ~ has(X1,ifthen(X5,X2))
      | succeeds(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]),
    [final] ).

tcf(c_0_16,hypothesis,
    has(p3,ifthen(equal_function(register_j,n),p4)),
    inference(split_conjunct,[status(thm)],[state_3]),
    [final] ).

tcf(c_0_18,hypothesis,
    ! [X1: state] :
      ( ~ has(X1,goto(loop))
      | succeeds(p3,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]),
    [final] ).

tcf(c_0_19,hypothesis,
    has(p8,goto(loop)),
    inference(split_conjunct,[status(thm)],[state_8]),
    [final] ).

tcf(c_0_20,plain,
    ! [X1: state,X2: state,X3: state] :
      ( ~ succeeds(X2,X3)
      | ~ succeeds(X1,X2)
      | succeeds(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_14]),
    [final] ).

tcf(c_0_21,hypothesis,
    succeeds(p4,p3),
    inference(spm,[status(thm)],[c_0_15,c_0_16]),
    [final] ).

tcf(c_0_22,plain,
    ! [X1: state,X2: state] :
      ( ~ follows(X1,X2)
      | succeeds(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]),
    [final] ).

tcf(c_0_23,hypothesis,
    follows(p5,p4),
    inference(split_conjunct,[status(thm)],[transition_4_to_5]),
    [final] ).

tcf(c_0_24,hypothesis,
    succeeds(p3,p8),
    inference(spm,[status(thm)],[c_0_18,c_0_19]),
    [final] ).

tcf(c_0_25,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p4)
      | succeeds(X1,p3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]),
    [final] ).

tcf(c_0_26,hypothesis,
    succeeds(p5,p4),
    inference(spm,[status(thm)],[c_0_22,c_0_23]),
    [final] ).

tcf(c_0_27,hypothesis,
    follows(p8,p3),
    inference(split_conjunct,[status(thm)],[transition_3_to_8]),
    [final] ).

tcf(c_0_28,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p3)
      | succeeds(X1,p8) ),
    inference(spm,[status(thm)],[c_0_20,c_0_24]),
    [final] ).

tcf(c_0_29,hypothesis,
    succeeds(p5,p3),
    inference(spm,[status(thm)],[c_0_25,c_0_26]),
    [final] ).

tcf(c_0_30,hypothesis,
    succeeds(p8,p3),
    inference(spm,[status(thm)],[c_0_22,c_0_27]),
    [final] ).

tcf(c_0_31,hypothesis,
    succeeds(p4,p8),
    inference(spm,[status(thm)],[c_0_28,c_0_21]),
    [final] ).

tcf(c_0_32,hypothesis,
    succeeds(p5,p8),
    inference(spm,[status(thm)],[c_0_28,c_0_29]),
    [final] ).

tcf(c_0_33,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p8)
      | succeeds(X1,p3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_30]),
    [final] ).

tcf(c_0_34,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p4)
      | succeeds(X1,p8) ),
    inference(spm,[status(thm)],[c_0_20,c_0_31]),
    [final] ).

tcf(c_0_35,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p5)
      | succeeds(X1,p8) ),
    inference(spm,[status(thm)],[c_0_20,c_0_32]),
    [final] ).

tcf(c_0_36,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p5)
      | succeeds(X1,p3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_29]),
    [final] ).

tcf(c_0_37,hypothesis,
    ! [X1: state] :
      ( ~ succeeds(X1,p5)
      | succeeds(X1,p4) ),
    inference(spm,[status(thm)],[c_0_20,c_0_26]),
    [final] ).

tcf(c_0_38,hypothesis,
    succeeds(p8,p8),
    inference(spm,[status(thm)],[c_0_28,c_0_30]),
    [final] ).

tcf(c_0_39,hypothesis,
    succeeds(p3,p3),
    inference(spm,[status(thm)],[c_0_33,c_0_24]),
    [final] ).

tcf(c_0_40,hypothesis,
    has(p4,goto(out)),
    inference(split_conjunct,[status(thm)],[state_4]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM001_10 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n018.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 14:15:44 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.46  Running first-order theorem proving
% 0.14/0.46  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.53  % Version: 3.5.1
% 0.14/0.53  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.53  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.53  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.53  % Starting sh5l with 300s (1) cores
% 0.14/0.53  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2107088 completed with status 1
% 0.14/0.53  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.53  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.53  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.53  % No SInE strategy applied
% 0.14/0.53  % Search class: FHUNF-FFSM21-SFFFFFNN
% 0.14/0.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.53  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.53  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.53  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.53  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.53  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.53  % new_bool_3 with pid 2107098 completed with status 1
% 0.14/0.53  % Result found by new_bool_3
% 0.14/0.53  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.53  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.53  % No SInE strategy applied
% 0.14/0.53  % Search class: FHUNF-FFSM21-SFFFFFNN
% 0.14/0.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.53  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.53  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.53  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.53  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.53  % Preprocessing time       : 0.002 s
% 0.14/0.53  % Presaturation interreduction done
% 0.14/0.53  
% 0.14/0.53  % No proof found!
% 0.14/0.53  % SZS status Satisfiable
% 0.14/0.53  % SZS output start Saturation
% See solution above
% 0.14/0.53  % Parsed axioms                        : 31
% 0.14/0.53  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.53  % Initial clauses                      : 31
% 0.14/0.53  % Removed in clause preprocessing      : 21
% 0.14/0.53  % Initial clauses in saturation        : 10
% 0.14/0.53  % Processed clauses                    : 37
% 0.14/0.53  % ...of these trivial                  : 0
% 0.14/0.53  % ...subsumed                          : 0
% 0.14/0.53  % ...remaining for further processing  : 37
% 0.14/0.53  % Other redundant clauses eliminated   : 0
% 0.14/0.53  % Clauses deleted for lack of memory   : 0
% 0.14/0.53  % Backward-subsumed                    : 0
% 0.14/0.53  % Backward-rewritten                   : 0
% 0.14/0.53  % Generated clauses                    : 24
% 0.14/0.53  % ...of the previous two non-redundant : 17
% 0.14/0.53  % ...aggressively subsumed             : 0
% 0.14/0.53  % Contextual simplify-reflections      : 0
% 0.14/0.53  % Paramodulations                      : 24
% 0.14/0.53  % Factorizations                       : 0
% 0.14/0.53  % NegExts                              : 0
% 0.14/0.53  % Equation resolutions                 : 0
% 0.14/0.53  % Disequality decompositions           : 0
% 0.14/0.53  % Total rewrite steps                  : 5
% 0.14/0.53  % ...of those cached                   : 0
% 0.14/0.53  % Propositional unsat checks           : 0
% 0.14/0.53  %    Propositional check models        : 0
% 0.14/0.53  %    Propositional check unsatisfiable : 0
% 0.14/0.53  %    Propositional clauses             : 0
% 0.14/0.53  %    Propositional clauses after purity: 0
% 0.14/0.53  %    Propositional unsat core size     : 0
% 0.14/0.53  %    Propositional preprocessing time  : 0.000
% 0.14/0.53  %    Propositional encoding time       : 0.000
% 0.14/0.53  %    Propositional solver time         : 0.000
% 0.14/0.53  %    Success case prop preproc time    : 0.000
% 0.14/0.53  %    Success case prop encoding time   : 0.000
% 0.14/0.53  %    Success case prop solver time     : 0.000
% 0.14/0.53  % Current number of processed clauses  : 27
% 0.14/0.53  %    Positive orientable unit clauses  : 15
% 0.14/0.53  %    Positive unorientable unit clauses: 0
% 0.14/0.53  %    Negative unit clauses             : 0
% 0.14/0.53  %    Non-unit-clauses                  : 12
% 0.14/0.53  % Current number of unprocessed clauses: 0
% 0.14/0.53  % ...number of literals in the above   : 0
% 0.14/0.53  % Current number of archived formulas  : 0
% 0.14/0.53  % Current number of archived clauses   : 10
% 0.14/0.53  % Clause-clause subsumption calls (NU) : 39
% 0.14/0.53  % Rec. Clause-clause subsumption calls : 39
% 0.14/0.53  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.53  % Unit Clause-clause subsumption calls : 0
% 0.14/0.53  % Rewrite failures with RHS unbound    : 0
% 0.14/0.53  % BW rewrite match attempts            : 0
% 0.14/0.53  % BW rewrite match successes           : 0
% 0.14/0.53  % Condensation attempts                : 0
% 0.14/0.53  % Condensation successes               : 0
% 0.14/0.53  % Termbank termtop insertions          : 1014
% 0.14/0.53  % Search garbage collected termcells   : 66
% 0.14/0.53  
% 0.14/0.53  % -------------------------------------------------
% 0.14/0.53  % User time                : 0.008 s
% 0.14/0.53  % System time              : 0.003 s
% 0.14/0.53  % Total time               : 0.012 s
% 0.14/0.53  % Maximum resident set size: 3648 pages
% 0.14/0.53  
% 0.14/0.53  % -------------------------------------------------
% 0.14/0.53  % User time                : 0.021 s
% 0.14/0.53  % System time              : 0.013 s
% 0.14/0.53  % Total time               : 0.034 s
% 0.14/0.53  % Maximum resident set size: 4608 pages
% 0.14/0.53  % E exiting
%------------------------------------------------------------------------------