↑ Up

E---3.5.1.CSA-Sat.s

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

% Computer : n019.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 01:18:11 PM UTC 2026

% Result   : CounterSatisfiable 0.12s 0.43s
% Output   : Saturation 0.12s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_5ERROR: Could not build tree for root c_0_22ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
tcf(c_0_7,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_5]),
    [final] ).

tcf(c_0_8,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_accessible'(esk3_1(X3),esk5_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_9,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_accessible'('$ki_local_world',esk3_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_12,negated_conjecture,
    ! [X4,X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_exists_in_world_$i'(esk3_1(X3),X4)
      | '$ki_exists_in_world_$i'(esk5_1(X3),X4) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]),
    [final] ).

tcf(c_0_13,negated_conjecture,
    ! [X4,X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
      | '$ki_exists_in_world_$i'(esk3_1(X3),X4) ),
    inference(spm,[status(thm)],[c_0_7,c_0_9]),
    [final] ).

tcf(c_0_14,plain,
    ! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk2_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]),
    [final] ).

tcf(c_0_15,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ big_q(esk6_1(X3),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_16,negated_conjecture,
    ! [X1: '$ki_world',X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_accessible'(esk5_1(X3),X1)
      | big_q(X1,esk4_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_17,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_exists_in_world_$i'(esk3_1(X3),esk4_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_18,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_accessible'(esk5_1(X3),esk6_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_19,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_accessible'(esk5_1(X3),esk7_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_20,negated_conjecture,
    ! [X1: '$ki_world',X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_accessible'(esk5_1(X3),X1)
      | big_p(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

tcf(c_0_21,plain,
    ! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_11]),
    [final] ).

tcf(c_0_22,negated_conjecture,
    ! [X3,X4] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
      | ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_exists_in_world_$i'(esk5_1(X3),X4) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]),
    [final] ).

tcf(c_0_23,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_exists_in_world_$i'(esk5_1(X3),esk2_1(esk3_1(X3))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_14]),
    [final] ).

tcf(c_0_24,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_accessible'(esk5_1(X3),esk6_1(esk4_1(X3)))
      | ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_exists_in_world_$i'('$ki_local_world',esk4_1(X3)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]),
    [final] ).

tcf(c_0_25,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | '$ki_exists_in_world_$i'(esk5_1(X3),esk4_1(X3)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_17]),
    [final] ).

tcf(c_0_26,negated_conjecture,
    ! [X4,X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_exists_in_world_$i'(esk5_1(X3),X4)
      | '$ki_exists_in_world_$i'(esk6_1(X3),X4) ),
    inference(spm,[status(thm)],[c_0_7,c_0_18]),
    [final] ).

tcf(c_0_27,negated_conjecture,
    ! [X4,X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ '$ki_exists_in_world_$i'(esk5_1(X3),X4)
      | '$ki_exists_in_world_$i'(esk7_1(X3),X4) ),
    inference(spm,[status(thm)],[c_0_7,c_0_19]),
    [final] ).

tcf(c_0_28,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | big_p(esk1_1(esk5_1(X3)),X3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]),
    [final] ).

tcf(c_0_29,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | big_p(esk6_1(X3),X3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_18]),
    [final] ).

tcf(c_0_30,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | big_p(esk7_1(X3),X3) ),
    inference(spm,[status(thm)],[c_0_20,c_0_19]),
    [final] ).

tcf(c_0_31,plain,
    ! [X1: '$ki_world',X3] :
      ( ~ '$ki_exists_in_world_$i'(X1,X3)
      | '$ki_exists_in_world_$i'(esk1_1(X1),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_21]),
    [final] ).

tcf(c_0_32,negated_conjecture,
    ! [X3] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
      | ~ big_p(esk7_1(X3),esk4_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

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