↑ Up

E---3.5.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO908_13 : 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 : n017.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:49:00 PM UTC 2026

% Result   : CounterSatisfiable 0.23s 5.56s
% Output   : Saturation 0.23s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3ERROR: Could not build tree for root c_0_19ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
tcf(c_0_5,plain,
    ! [X1: '$ki_world',X3,X2: '$ki_world'] :
      ( ~ '$ki_accessible'(X1,X2)
      | ~ '$ki_exists_in_world_$i'(X1,X3)
      | '$ki_exists_in_world_$i'(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_3]),
    [final] ).

tcf(c_0_6,plain,
    ! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk1_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

tcf(c_0_8,plain,
    ! [X2: '$ki_world',X1: '$ki_world'] :
      ( ~ '$ki_accessible'(X2,X1)
      | '$ki_exists_in_world_$i'(X1,esk1_1(X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]),
    [final] ).

tcf(c_0_10,plain,
    ! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world'] :
      ( ~ '$ki_accessible'(X2,X4)
      | ~ '$ki_accessible'(X4,X1)
      | '$ki_exists_in_world_$i'(X1,esk1_1(X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_8]),
    [final] ).

tcf(c_0_11,negated_conjecture,
    '$ki_accessible'('$ki_local_world',esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_9]),
    [final] ).

tcf(c_0_12,negated_conjecture,
    '$ki_exists_in_world_$i'('$ki_local_world',esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]),
    [final] ).

tcf(c_0_13,negated_conjecture,
    ! [X1: '$ki_world'] :
      ( ~ '$ki_accessible'(X1,'$ki_local_world')
      | '$ki_exists_in_world_$i'(esk3_0,esk1_1(X1)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]),
    [final] ).

tcf(c_0_14,negated_conjecture,
    ! [X1: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X1)
      | '$ki_exists_in_world_$i'(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_12]),
    [final] ).

tcf(c_0_15,negated_conjecture,
    ! [X1: '$ki_world',X2: '$ki_world'] :
      ( ~ '$ki_accessible'(X2,'$ki_local_world')
      | ~ '$ki_accessible'(esk3_0,X1)
      | '$ki_exists_in_world_$i'(X1,esk1_1(X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_13]),
    [final] ).

tcf(c_0_16,negated_conjecture,
    '$ki_exists_in_world_$i'(esk3_0,esk2_0),
    inference(spm,[status(thm)],[c_0_14,c_0_11]),
    [final] ).

tcf(c_0_17,negated_conjecture,
    ~ g(esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]),
    [final] ).

tcf(c_0_18,negated_conjecture,
    ! [X1: '$ki_world',X3] :
      ( ~ f(X1,X3)
      | ~ '$ki_accessible'('$ki_local_world',X1)
      | ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | g(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]),
    [final] ).

tcf(c_0_19,negated_conjecture,
    ! [X4: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
      ( ~ '$ki_accessible'(X4,X1)
      | ~ '$ki_accessible'(X2,'$ki_local_world')
      | ~ '$ki_accessible'(esk3_0,X4)
      | '$ki_exists_in_world_$i'(X1,esk1_1(X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_15]),
    [final] ).

tcf(c_0_20,negated_conjecture,
    ! [X1: '$ki_world'] :
      ( ~ '$ki_accessible'(esk3_0,X1)
      | '$ki_exists_in_world_$i'(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_16]),
    [final] ).

tcf(c_0_21,negated_conjecture,
    ~ f(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]),c_0_11])]),
    [final] ).

tcf(c_0_22,negated_conjecture,
    f('$ki_local_world',esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYO908_13 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.46  % Computer : n017.cluster.edu
% 0.18/5.46  % Model    : x86_64 x86_64
% 0.18/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46  % Memory   : 8046.5625MB
% 0.18/5.46  % OS       : Linux 6.8.0-71-generic
% 0.18/5.46  % CPULimit : 300
% 0.18/5.46  % WCLimit  : 300
% 0.18/5.46  % DateTime : Mon Sep 21 12:26:47 UTC 2026
% 0.18/5.46  % CPUTime  : 
% 0.18/5.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.53  Running first-order theorem proving
% 0.23/5.53  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.23/5.56  % Version: 3.5.1
% 0.23/5.56  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/5.56  % Starting new_bool_3 with 300s (1) cores
% 0.23/5.56  % Starting new_bool_1 with 300s (1) cores
% 0.23/5.56  % Starting sh5l with 300s (1) cores
% 0.23/5.56  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2300614 completed with status 1
% 0.23/5.56  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/5.56  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/5.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.56  % No SInE strategy applied
% 0.23/5.56  % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.23/5.56  % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.23/5.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.56  % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/5.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/5.56  % Starting new_bool_3 with 136s (1) cores
% 0.23/5.56  % Starting new_bool_1 with 136s (1) cores
% 0.23/5.56  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2300619 completed with status 1
% 0.23/5.56  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/5.56  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/5.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.56  % No SInE strategy applied
% 0.23/5.56  % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.23/5.56  % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.23/5.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.56  % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/5.56  % Preprocessing time       : 0.001 s
% 0.23/5.56  
% 0.23/5.56  % No proof found!
% 0.23/5.56  % SZS status CounterSatisfiable
% 0.23/5.56  % SZS output start Saturation
% See solution above
% 0.23/5.56  % Parsed axioms                        : 9
% 0.23/5.56  % Removed by relevancy pruning/SinE    : 0
% 0.23/5.56  % Initial clauses                      : 13
% 0.23/5.56  % Removed in clause preprocessing      : 6
% 0.23/5.56  % Initial clauses in saturation        : 7
% 0.23/5.56  % Processed clauses                    : 16
% 0.23/5.56  % ...of these trivial                  : 0
% 0.23/5.56  % ...subsumed                          : 0
% 0.23/5.56  % ...remaining for further processing  : 16
% 0.23/5.56  % Other redundant clauses eliminated   : 0
% 0.23/5.56  % Clauses deleted for lack of memory   : 0
% 0.23/5.56  % Backward-subsumed                    : 0
% 0.23/5.56  % Backward-rewritten                   : 0
% 0.23/5.56  % Generated clauses                    : 9
% 0.23/5.56  % ...of the previous two non-redundant : 9
% 0.23/5.56  % ...aggressively subsumed             : 0
% 0.23/5.56  % Contextual simplify-reflections      : 0
% 0.23/5.56  % Paramodulations                      : 9
% 0.23/5.56  % Factorizations                       : 0
% 0.23/5.56  % NegExts                              : 0
% 0.23/5.56  % Equation resolutions                 : 0
% 0.23/5.56  % Disequality decompositions           : 0
% 0.23/5.56  % Total rewrite steps                  : 2
% 0.23/5.56  % ...of those cached                   : 0
% 0.23/5.56  % Propositional unsat checks           : 0
% 0.23/5.56  %    Propositional check models        : 0
% 0.23/5.56  %    Propositional check unsatisfiable : 0
% 0.23/5.56  %    Propositional clauses             : 0
% 0.23/5.56  %    Propositional clauses after purity: 0
% 0.23/5.56  %    Propositional unsat core size     : 0
% 0.23/5.56  %    Propositional preprocessing time  : 0.000
% 0.23/5.56  %    Propositional encoding time       : 0.000
% 0.23/5.56  %    Propositional solver time         : 0.000
% 0.23/5.56  %    Success case prop preproc time    : 0.000
% 0.23/5.56  %    Success case prop encoding time   : 0.000
% 0.23/5.56  %    Success case prop solver time     : 0.000
% 0.23/5.56  % Current number of processed clauses  : 16
% 0.23/5.56  %    Positive orientable unit clauses  : 5
% 0.23/5.56  %    Positive unorientable unit clauses: 0
% 0.23/5.56  %    Negative unit clauses             : 2
% 0.23/5.56  %    Non-unit-clauses                  : 9
% 0.23/5.56  % Current number of unprocessed clauses: 0
% 0.23/5.56  % ...number of literals in the above   : 0
% 0.23/5.56  % Current number of archived formulas  : 0
% 0.23/5.56  % Current number of archived clauses   : 0
% 0.23/5.56  % Clause-clause subsumption calls (NU) : 22
% 0.23/5.56  % Rec. Clause-clause subsumption calls : 22
% 0.23/5.56  % Non-unit clause-clause subsumptions  : 0
% 0.23/5.56  % Unit Clause-clause subsumption calls : 1
% 0.23/5.56  % Rewrite failures with RHS unbound    : 0
% 0.23/5.56  % BW rewrite match attempts            : 0
% 0.23/5.56  % BW rewrite match successes           : 0
% 0.23/5.56  % Condensation attempts                : 0
% 0.23/5.56  % Condensation successes               : 0
% 0.23/5.56  % Termbank termtop insertions          : 749
% 0.23/5.56  % Search garbage collected termcells   : 137
% 0.23/5.56  
% 0.23/5.56  % -------------------------------------------------
% 0.23/5.56  % User time                : 0.005 s
% 0.23/5.56  % System time              : 0.003 s
% 0.23/5.56  % Total time               : 0.008 s
% 0.23/5.56  % Maximum resident set size: 3632 pages
% 0.23/5.56  
% 0.23/5.56  % -------------------------------------------------
% 0.23/5.56  % User time                : 0.013 s
% 0.23/5.56  % System time              : 0.017 s
% 0.23/5.56  % Total time               : 0.030 s
% 0.23/5.56  % Maximum resident set size: 4608 pages
% 0.23/5.56  % E exiting
%------------------------------------------------------------------------------