↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KRS039+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 01:00:37 PM UTC 2026

% Result   : Satisfiable 0.24s 0.58s
% Output   : Saturation 0.24s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_7ERROR: Could not build tree for root c_0_15ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_10,plain,
    ( ~ rr(X1,X2)
    | rinvR(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

cnf(c_0_11,plain,
    ( ~ cSatisfiable(X1)
    | rr(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_12,plain,
    ( ~ cSatisfiable(X1)
    | rr(X1,esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_15,plain,
    ( ~ rr(X1,X3)
    | ~ rr(X1,X2)
    | cSatisfiable(X1)
    | rr1(esk3_2(X1,X3),esk4_2(X1,X3))
    | rr1(esk5_2(X1,X2),esk6_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_16,plain,
    ( ~ rr(X1,X3)
    | ~ rr(X1,X2)
    | cSatisfiable(X1)
    | rinvR(X3,esk3_2(X1,X3))
    | rr1(esk5_2(X1,X2),esk6_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_17,plain,
    ( ~ rr(X2,X3)
    | ~ rr(X2,X1)
    | cSatisfiable(X2)
    | rr1(esk3_2(X2,X3),esk4_2(X2,X3))
    | rinvR(X1,esk5_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_18,plain,
    ( ~ rr(X1,X3)
    | ~ rr(X1,X2)
    | cSatisfiable(X1)
    | rr1(esk3_2(X1,X3),esk4_2(X1,X3))
    | cp(esk6_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_19,plain,
    ( ~ rr(X1,X3)
    | ~ cp(esk4_2(X1,X3))
    | ~ rr(X1,X2)
    | cSatisfiable(X1)
    | rr1(esk5_2(X1,X2),esk6_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_20,plain,
    ( ~ cSatisfiable(X1)
    | rinvR(esk2_1(X1),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]),
    [final] ).

cnf(c_0_21,plain,
    ( ~ rr(X2,X3)
    | ~ rr(X2,X1)
    | cSatisfiable(X2)
    | rinvR(X3,esk3_2(X2,X3))
    | rinvR(X1,esk5_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_22,plain,
    ( ~ rr(X1,X3)
    | ~ rr(X1,X2)
    | cSatisfiable(X1)
    | rinvR(X3,esk3_2(X1,X3))
    | cp(esk6_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_23,plain,
    ( ~ rr(X2,X3)
    | ~ cp(esk4_2(X2,X3))
    | ~ rr(X2,X1)
    | cSatisfiable(X2)
    | rinvR(X1,esk5_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_24,plain,
    ( ~ rr(X1,X3)
    | ~ cp(esk4_2(X1,X3))
    | ~ rr(X1,X2)
    | cSatisfiable(X1)
    | cp(esk6_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_25,plain,
    ( ~ cSatisfiable(X1)
    | ~ rr1(X2,X3)
    | ~ rinvR(esk1_1(X1),X2)
    | cp(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_26,plain,
    ( ~ cSatisfiable(X1)
    | rinvR(esk1_1(X1),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_12]),
    [final] ).

cnf(c_0_27,plain,
    ( ~ cSatisfiable(X1)
    | ~ cp(X3)
    | ~ rr1(X2,X3)
    | ~ rinvR(esk2_1(X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

cnf(c_0_28,plain,
    ( ~ rinvR(X1,X2)
    | rr(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

cnf(c_0_29,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]),
    [final] ).

cnf(c_0_30,plain,
    ( ~ xsd_integer(X1)
    | ~ xsd_string(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]),
    [final] ).

cnf(c_0_31,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[c_0_14]),
    [final] ).

cnf(c_0_32,plain,
    cSatisfiable(i2003_11_14_17_15_58383),
    inference(split_conjunct,[status(thm)],[axiom_4]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS039+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  % Computer : n018.cluster.edu
% 0.16/0.43  % Model    : x86_64 x86_64
% 0.16/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43  % Memory   : 8046.5625MB
% 0.16/0.43  % OS       : Linux 6.8.0-71-generic
% 0.16/0.43  % CPULimit : 300
% 0.16/0.43  % WCLimit  : 300
% 0.16/0.43  % DateTime : Sun Sep 20 22:53:28 UTC 2026
% 0.16/0.44  % CPUTime  : 
% 0.16/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.50  Running first-order theorem proving
% 0.16/0.51  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.24/0.58  % Version: 3.5.1
% 0.24/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.58  % Starting sh5l with 300s (1) cores
% 0.24/0.58  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 371022 completed with status 1
% 0.24/0.58  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.58  % No SInE strategy applied
% 0.24/0.58  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.24/0.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.58  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.58  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.58  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.58  % Starting new_bool_1 with 136s (1) cores
% 0.24/0.58  % new_bool_3 with pid 371037 completed with status 1
% 0.24/0.58  % Result found by new_bool_3
% 0.24/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.58  % No SInE strategy applied
% 0.24/0.58  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.24/0.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.58  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.58  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.58  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.58  % Preprocessing time       : 0.001 s
% 0.24/0.58  % Presaturation interreduction done
% 0.24/0.58  
% 0.24/0.58  % No proof found!
% 0.24/0.58  % SZS status Satisfiable
% 0.24/0.58  % SZS output start Saturation
% See solution above
% 0.24/0.58  % Parsed axioms                        : 5
% 0.24/0.58  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.58  % Initial clauses                      : 20
% 0.24/0.58  % Removed in clause preprocessing      : 1
% 0.24/0.58  % Initial clauses in saturation        : 19
% 0.24/0.58  % Processed clauses                    : 42
% 0.24/0.58  % ...of these trivial                  : 0
% 0.24/0.58  % ...subsumed                          : 2
% 0.24/0.58  % ...remaining for further processing  : 40
% 0.24/0.58  % Other redundant clauses eliminated   : 0
% 0.24/0.58  % Clauses deleted for lack of memory   : 0
% 0.24/0.58  % Backward-subsumed                    : 0
% 0.24/0.58  % Backward-rewritten                   : 0
% 0.24/0.58  % Generated clauses                    : 17
% 0.24/0.58  % ...of the previous two non-redundant : 4
% 0.24/0.58  % ...aggressively subsumed             : 0
% 0.24/0.58  % Contextual simplify-reflections      : 0
% 0.24/0.58  % Paramodulations                      : 17
% 0.24/0.58  % Factorizations                       : 0
% 0.24/0.58  % NegExts                              : 0
% 0.24/0.58  % Equation resolutions                 : 0
% 0.24/0.58  % Disequality decompositions           : 0
% 0.24/0.58  % Total rewrite steps                  : 0
% 0.24/0.58  % ...of those cached                   : 0
% 0.24/0.58  % Propositional unsat checks           : 0
% 0.24/0.58  %    Propositional check models        : 0
% 0.24/0.58  %    Propositional check unsatisfiable : 0
% 0.24/0.58  %    Propositional clauses             : 0
% 0.24/0.58  %    Propositional clauses after purity: 0
% 0.24/0.58  %    Propositional unsat core size     : 0
% 0.24/0.58  %    Propositional preprocessing time  : 0.000
% 0.24/0.58  %    Propositional encoding time       : 0.000
% 0.24/0.58  %    Propositional solver time         : 0.000
% 0.24/0.58  %    Success case prop preproc time    : 0.000
% 0.24/0.58  %    Success case prop encoding time   : 0.000
% 0.24/0.58  %    Success case prop solver time     : 0.000
% 0.24/0.58  % Current number of processed clauses  : 21
% 0.24/0.58  %    Positive orientable unit clauses  : 1
% 0.24/0.58  %    Positive unorientable unit clauses: 0
% 0.24/0.58  %    Negative unit clauses             : 1
% 0.24/0.58  %    Non-unit-clauses                  : 19
% 0.24/0.58  % Current number of unprocessed clauses: 0
% 0.24/0.58  % ...number of literals in the above   : 0
% 0.24/0.58  % Current number of archived formulas  : 0
% 0.24/0.58  % Current number of archived clauses   : 20
% 0.24/0.58  % Clause-clause subsumption calls (NU) : 297
% 0.24/0.58  % Rec. Clause-clause subsumption calls : 94
% 0.24/0.58  % Non-unit clause-clause subsumptions  : 2
% 0.24/0.58  % Unit Clause-clause subsumption calls : 0
% 0.24/0.58  % Rewrite failures with RHS unbound    : 0
% 0.24/0.58  % BW rewrite match attempts            : 0
% 0.24/0.58  % BW rewrite match successes           : 0
% 0.24/0.58  % Condensation attempts                : 0
% 0.24/0.58  % Condensation successes               : 0
% 0.24/0.58  % Termbank termtop insertions          : 1832
% 0.24/0.58  % Search garbage collected termcells   : 294
% 0.24/0.58  
% 0.24/0.58  % -------------------------------------------------
% 0.24/0.58  % User time                : 0.010 s
% 0.24/0.58  % System time              : 0.002 s
% 0.24/0.58  % Total time               : 0.012 s
% 0.24/0.58  % Maximum resident set size: 3632 pages
% 0.24/0.58  
% 0.24/0.58  % -------------------------------------------------
% 0.24/0.58  % User time                : 0.021 s
% 0.24/0.58  % System time              : 0.017 s
% 0.24/0.58  % Total time               : 0.038 s
% 0.24/0.58  % Maximum resident set size: 4864 pages
% 0.24/0.58  % E exiting
%------------------------------------------------------------------------------