↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n013.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:34:56 PM UTC 2026

% Result   : Satisfiable 0.25s 0.59s
% Output   : Saturation 0.25s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_42ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_42,negated_conjecture,
    actual_world(skc20),
    clause1,
    [final] ).

cnf(c_0_86,negated_conjecture,
    ssSkC0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74]),c_0_75]),c_0_76]),c_0_45]),c_0_77]),
    [final] ).

cnf(c_0_96,negated_conjecture,
    actual_world(skc8),
    clause2,
    [final] ).

cnf(c_0_105,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ event(X1,X5)
    | ~ event(X1,X2)
    | ~ past(X1,X5)
    | ~ past(X1,X2)
    | ~ nonreflexive(X1,X5)
    | ~ nonreflexive(X1,X2)
    | ~ drink(X1,X5)
    | ~ coffee(X1,X6)
    | ~ human_person(X1,X4)
    | ~ restaurant(X1,X3)
    | ~ patient(X1,X5,X6)
    | ~ patient(X1,X2,X4)
    | ~ agent(X1,X5,X4)
    | ~ agent(X1,X2,skf12(X1,X3,X4))
    | ~ see(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]),
    [final] ).

cnf(c_0_106,negated_conjecture,
    ( ~ in(skc8,X1,skc10)
    | ~ customer(skc8,X1)
    | agent(skc8,skf8(X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_86])]),
    [final] ).

cnf(c_0_107,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | event(skc8,skf8(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_86])]),
    [final] ).

cnf(c_0_108,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | past(skc8,skf8(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_86])]),
    [final] ).

cnf(c_0_109,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | nonreflexive(skc8,skf8(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_86])]),
    [final] ).

cnf(c_0_110,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | see(skc8,skf8(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_86])]),
    [final] ).

cnf(c_0_123,negated_conjecture,
    ( ~ event(skc8,X3)
    | ~ past(skc8,X3)
    | ~ nonreflexive(skc8,X3)
    | ~ drink(skc8,X3)
    | ~ coffee(skc8,X4)
    | ~ human_person(skc8,X2)
    | ~ restaurant(skc8,X1)
    | ~ patient(skc8,X3,X4)
    | ~ patient(skc8,skf8(skf12(skc8,X1,X2)),X2)
    | ~ agent(skc8,X3,X2)
    | ~ in(skc8,skf12(skc8,X1,X2),skc10)
    | ~ customer(skc8,skf12(skc8,X1,X2)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_96])]),c_0_107]),c_0_108]),c_0_109]),c_0_110]),
    [final] ).

cnf(c_0_124,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ event(X1,X4)
    | ~ past(X1,X4)
    | ~ nonreflexive(X1,X4)
    | ~ drink(X1,X4)
    | ~ coffee(X1,X6)
    | ~ human_person(X1,X5)
    | ~ restaurant(X1,X2)
    | ~ patient(X1,X4,X6)
    | ~ agent(X1,X4,X5)
    | in(X1,skf12(X1,X2,X3),X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_86])]),
    [final] ).

cnf(c_0_125,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ event(X1,X4)
    | ~ past(X1,X4)
    | ~ nonreflexive(X1,X4)
    | ~ drink(X1,X4)
    | ~ coffee(X1,X6)
    | ~ human_person(X1,X5)
    | ~ restaurant(X1,X7)
    | ~ patient(X1,X4,X6)
    | ~ agent(X1,X4,X5)
    | customer(X1,skf12(X1,X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_86])]),
    [final] ).

cnf(c_0_126,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | patient(skc8,skf8(X1),skf10(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_86])]),
    [final] ).

cnf(c_0_127,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | agent(skc8,skf9(X1),skf10(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_86])]),
    [final] ).

cnf(c_0_128,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | patient(skc8,skf9(X1),skc9) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_86])]),
    [final] ).

cnf(c_0_129,negated_conjecture,
    ( ~ drink(skc8,skf8(X3))
    | ~ coffee(skc8,X4)
    | ~ human_person(skc8,X3)
    | ~ restaurant(skc8,X5)
    | ~ patient(skc8,skf8(X3),X4)
    | ~ in(skc8,X3,skc10)
    | ~ customer(skc8,X3)
    | customer(skc8,skf12(skc8,X1,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_86])]),
    [final] ).

cnf(c_0_130,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | event(skc8,skf9(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_86])]),
    [final] ).

cnf(c_0_131,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | past(skc8,skf9(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_86])]),
    [final] ).

cnf(c_0_132,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | nonreflexive(skc8,skf9(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_86])]),
    [final] ).

cnf(c_0_133,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | drink(skc8,skf9(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_86])]),
    [final] ).

cnf(c_0_134,negated_conjecture,
    ( ~ in(skc8,X2,skc10)
    | ~ customer(skc8,X2)
    | human_person(skc8,skf10(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_86])]),
    [final] ).

cnf(c_0_135,negated_conjecture,
    ( ~ drink(skc8,skf8(X3))
    | ~ coffee(skc8,X4)
    | ~ human_person(skc8,X3)
    | ~ restaurant(skc8,X1)
    | ~ patient(skc8,skf8(X3),X4)
    | ~ in(skc8,X3,skc10)
    | ~ customer(skc8,X3)
    | in(skc8,skf12(skc8,X1,X2),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_86])]),
    [final] ).

cnf(c_0_136,negated_conjecture,
    coffee(skc8,skc9),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_86])]),
    [final] ).

cnf(c_0_137,negated_conjecture,
    restaurant(skc8,skc10),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_86])]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NLP103-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46  % Computer : n013.cluster.edu
% 0.21/0.46  % Model    : x86_64 x86_64
% 0.21/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46  % Memory   : 8046.5625MB
% 0.21/0.46  % OS       : Linux 6.8.0-71-generic
% 0.21/0.46  % CPULimit : 300
% 0.21/0.46  % WCLimit  : 300
% 0.21/0.46  % DateTime : Mon Sep 21 01:39:06 UTC 2026
% 0.21/0.47  % CPUTime  : 
% 0.21/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.53  Running first-order theorem proving
% 0.25/0.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.25/0.59  % Version: 3.5.1
% 0.25/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.59  % Starting sh5l with 300s (1) cores
% 0.25/0.59  % new_bool_3 with pid 3885764 completed with status 1
% 0.25/0.59  % Result found by new_bool_3
% 0.25/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.59  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.59  % Search class: FGHNF-FFMM31-SFFFFFNN
% 0.25/0.59  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.59  % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.59  % SubtermCWHack with pid 3885772 completed with status 1
% 0.25/0.59  % Result found by SubtermCWHack
% 0.25/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.59  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.59  % Search class: FGHNF-FFMM31-SFFFFFNN
% 0.25/0.59  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.59  % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.59  % Preprocessing time       : 0.001 s
% 0.25/0.59  
% 0.25/0.59  % No proof found!
% 0.25/0.59  % SZS status Satisfiable
% 0.25/0.59  % SZS output start Saturation
% See solution above
% 0.25/0.59  % Parsed axioms                        : 38
% 0.25/0.59  % Removed by relevancy pruning/SinE    : 0
% 0.25/0.59  % Initial clauses                      : 38
% 0.25/0.59  % Removed in clause preprocessing      : 0
% 0.25/0.59  % Initial clauses in saturation        : 38
% 0.25/0.59  % Processed clauses                    : 75
% 0.25/0.59  % ...of these trivial                  : 0
% 0.25/0.59  % ...subsumed                          : 2
% 0.25/0.59  % ...remaining for further processing  : 73
% 0.25/0.59  % Other redundant clauses eliminated   : 0
% 0.25/0.59  % Clauses deleted for lack of memory   : 0
% 0.25/0.59  % Backward-subsumed                    : 7
% 0.25/0.59  % Backward-rewritten                   : 42
% 0.25/0.59  % Generated clauses                    : 27
% 0.25/0.59  % ...of the previous two non-redundant : 41
% 0.25/0.59  % ...aggressively subsumed             : 0
% 0.25/0.59  % Contextual simplify-reflections      : 33
% 0.25/0.59  % Paramodulations                      : 27
% 0.25/0.59  % Factorizations                       : 0
% 0.25/0.59  % NegExts                              : 0
% 0.25/0.59  % Equation resolutions                 : 0
% 0.25/0.59  % Disequality decompositions           : 0
% 0.25/0.59  % Total rewrite steps                  : 59
% 0.25/0.59  % ...of those cached                   : 56
% 0.25/0.59  % Propositional unsat checks           : 0
% 0.25/0.59  %    Propositional check models        : 0
% 0.25/0.59  %    Propositional check unsatisfiable : 0
% 0.25/0.59  %    Propositional clauses             : 0
% 0.25/0.59  %    Propositional clauses after purity: 0
% 0.25/0.59  %    Propositional unsat core size     : 0
% 0.25/0.59  %    Propositional preprocessing time  : 0.000
% 0.25/0.59  %    Propositional encoding time       : 0.000
% 0.25/0.59  %    Propositional solver time         : 0.000
% 0.25/0.59  %    Success case prop preproc time    : 0.000
% 0.25/0.59  %    Success case prop encoding time   : 0.000
% 0.25/0.59  %    Success case prop solver time     : 0.000
% 0.25/0.59  % Current number of processed clauses  : 24
% 0.25/0.59  %    Positive orientable unit clauses  : 5
% 0.25/0.59  %    Positive unorientable unit clauses: 0
% 0.25/0.59  %    Negative unit clauses             : 0
% 0.25/0.59  %    Non-unit-clauses                  : 19
% 0.25/0.59  % Current number of unprocessed clauses: 0
% 0.25/0.59  % ...number of literals in the above   : 0
% 0.25/0.59  % Current number of archived formulas  : 0
% 0.25/0.59  % Current number of archived clauses   : 49
% 0.25/0.59  % Clause-clause subsumption calls (NU) : 1395
% 0.25/0.59  % Rec. Clause-clause subsumption calls : 412
% 0.25/0.59  % Non-unit clause-clause subsumptions  : 42
% 0.25/0.59  % Unit Clause-clause subsumption calls : 0
% 0.25/0.59  % Rewrite failures with RHS unbound    : 0
% 0.25/0.59  % BW rewrite match attempts            : 1
% 0.25/0.59  % BW rewrite match successes           : 1
% 0.25/0.59  % Condensation attempts                : 0
% 0.25/0.59  % Condensation successes               : 0
% 0.25/0.59  % Termbank termtop insertions          : 4299
% 0.25/0.59  % Search garbage collected termcells   : 186
% 0.25/0.59  
% 0.25/0.59  % -------------------------------------------------
% 0.25/0.59  % User time                : 0.013 s
% 0.25/0.59  % System time              : 0.001 s
% 0.25/0.59  % Total time               : 0.014 s
% 0.25/0.59  % Maximum resident set size: 3680 pages
% 0.25/0.59  
% 0.25/0.59  % -------------------------------------------------
% 0.25/0.59  % User time                : 0.015 s
% 0.25/0.59  % System time              : 0.009 s
% 0.25/0.59  % Total time               : 0.023 s
% 0.25/0.59  % Maximum resident set size: 4864 pages
% 0.25/0.59  % E exiting
%------------------------------------------------------------------------------