TSTP Solution File: NLP131-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP131-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:54:34 EDT 2024
% Result : Satisfiable 0.20s 0.50s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_54)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_61,negated_conjecture,
( member(X1,skf6(X1,X6),X6)
| ~ city(X1,X2)
| ~ chevy(X1,X2)
| ~ white(X1,X2)
| ~ dirty(X1,X2)
| ~ old(X1,X2)
| ~ agent(X1,X3,X2)
| ~ in(X1,X3,X2)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ of(X1,X4,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ barrel(X1,X3)
| ~ down(X1,X3,X5)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ group(X1,X6)
| ~ two(X1,X6)
| ~ ssSkP0(X6,X1)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_54,
[final] ).
cnf(c_0_62,negated_conjecture,
( down(skc12,skc14,skc15)
| ~ ssSkC0 ),
c_0_55,
[final] ).
cnf(c_0_63,negated_conjecture,
actual_world(skc12),
clause2,
[final] ).
cnf(c_0_64,negated_conjecture,
( event(skc12,skc14)
| ~ ssSkC0 ),
c_0_56,
[final] ).
cnf(c_0_65,negated_conjecture,
( present(skc12,skc14)
| ~ ssSkC0 ),
c_0_57,
[final] ).
cnf(c_0_66,negated_conjecture,
( barrel(skc12,skc14)
| ~ ssSkC0 ),
c_0_58,
[final] ).
cnf(c_0_67,negated_conjecture,
( lonely(skc12,skc15)
| ~ ssSkC0 ),
c_0_59,
[final] ).
cnf(c_0_68,negated_conjecture,
( street(skc12,skc15)
| ~ ssSkC0 ),
c_0_60,
[final] ).
cnf(c_0_75,negated_conjecture,
( member(skc12,skf6(skc12,X1),X1)
| ~ of(skc12,X2,X3)
| ~ in(skc12,skc14,X3)
| ~ agent(skc12,skc14,X3)
| ~ ssSkP0(X1,skc12)
| ~ two(skc12,X1)
| ~ group(skc12,X1)
| ~ hollywood_placename(skc12,X2)
| ~ placename(skc12,X2)
| ~ old(skc12,X3)
| ~ dirty(skc12,X3)
| ~ white(skc12,X3)
| ~ chevy(skc12,X3)
| ~ city(skc12,X3)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[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_61,c_0_62]),c_0_63])]),c_0_64]),c_0_65]),c_0_66]),c_0_67]),c_0_68]),
[final] ).
cnf(c_0_76,negated_conjecture,
( agent(skc12,skc14,skc17)
| ~ ssSkC0 ),
c_0_69,
[final] ).
cnf(c_0_77,negated_conjecture,
( chevy(skc12,skc17)
| ~ ssSkC0 ),
c_0_70,
[final] ).
cnf(c_0_78,negated_conjecture,
( white(skc12,skc17)
| ~ ssSkC0 ),
c_0_71,
[final] ).
cnf(c_0_79,negated_conjecture,
( dirty(skc12,skc17)
| ~ ssSkC0 ),
c_0_72,
[final] ).
cnf(c_0_80,negated_conjecture,
( old(skc12,skc17)
| ~ ssSkC0 ),
c_0_73,
[final] ).
cnf(c_0_81,negated_conjecture,
( ssSkC0
| member(X1,skf13(X1,X6),X6)
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ in(X1,X2,X4)
| ~ down(X1,X2,X4)
| ~ lonely(X1,X4)
| ~ street(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ group(X1,X6)
| ~ two(X1,X6)
| ~ ssSkP0(X6,X1)
| ~ actual_world(X1) ),
c_0_74,
[final] ).
cnf(c_0_82,negated_conjecture,
( ssSkC0
| down(skc32,skc34,skc35) ),
clause36,
[final] ).
cnf(c_0_83,negated_conjecture,
actual_world(skc32),
clause1,
[final] ).
cnf(c_0_84,negated_conjecture,
( ssSkC0
| event(skc32,skc34) ),
clause10,
[final] ).
cnf(c_0_85,negated_conjecture,
( ssSkC0
| present(skc32,skc34) ),
clause11,
[final] ).
cnf(c_0_86,negated_conjecture,
( ssSkC0
| barrel(skc32,skc34) ),
clause12,
[final] ).
cnf(c_0_87,negated_conjecture,
( ssSkC0
| lonely(skc32,skc35) ),
clause13,
[final] ).
cnf(c_0_88,negated_conjecture,
( ssSkC0
| street(skc32,skc35) ),
clause14,
[final] ).
cnf(c_0_107,negated_conjecture,
( member(skc12,skf6(skc12,X1),X1)
| ~ of(skc12,X2,skc17)
| ~ in(skc12,skc14,skc17)
| ~ ssSkP0(X1,skc12)
| ~ two(skc12,X1)
| ~ group(skc12,X1)
| ~ hollywood_placename(skc12,X2)
| ~ placename(skc12,X2)
| ~ city(skc12,skc17)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_78]),c_0_79]),c_0_80]),
[final] ).
cnf(c_0_108,negated_conjecture,
( member(skc32,skf13(skc32,X1),X1)
| ssSkC0
| ~ of(skc32,X2,skc35)
| ~ in(skc32,skc34,skc35)
| ~ agent(skc32,skc34,X3)
| ~ ssSkP0(X1,skc32)
| ~ two(skc32,X1)
| ~ group(skc32,X1)
| ~ hollywood_placename(skc32,X2)
| ~ placename(skc32,X2)
| ~ old(skc32,X3)
| ~ dirty(skc32,X3)
| ~ white(skc32,X3)
| ~ chevy(skc32,X3)
| ~ city(skc32,skc35) ),
inference(csr,[status(thm)],[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_81,c_0_82]),c_0_83])]),c_0_84]),c_0_85]),c_0_86]),c_0_87]),c_0_88]),
[final] ).
cnf(c_0_109,negated_conjecture,
( ssSkC0
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ in(X1,X2,X4)
| ~ down(X1,X2,X4)
| ~ lonely(X1,X4)
| ~ street(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ young(X1,skf13(X1,X6))
| ~ fellow(X1,skf13(X1,X6))
| ~ group(X1,X7)
| ~ two(X1,X7)
| ~ ssSkP0(X7,X1)
| ~ actual_world(X1) ),
c_0_89,
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ city(X1,X2)
| ~ chevy(X1,X2)
| ~ white(X1,X2)
| ~ dirty(X1,X2)
| ~ old(X1,X2)
| ~ agent(X1,X3,X2)
| ~ in(X1,X3,X2)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ of(X1,X4,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ barrel(X1,X3)
| ~ down(X1,X3,X5)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ young(X1,skf6(X1,X6))
| ~ fellow(X1,skf6(X1,X6))
| ~ group(X1,X7)
| ~ two(X1,X7)
| ~ ssSkP0(X7,X1)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_90,
[final] ).
cnf(c_0_111,negated_conjecture,
( be(X1,skf8(X1,X2),X2,skf7(X2,X1))
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
c_0_91,
[final] ).
cnf(c_0_112,negated_conjecture,
( ssSkP0(X5,X1)
| ~ in(X1,X2,skf11(X1,X3))
| ~ be(X1,X4,skf11(X1,X3),X2)
| ~ state(X1,X4) ),
c_0_92,
[final] ).
cnf(c_0_113,negated_conjecture,
( in(X1,skf7(X2,X1),X2)
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
c_0_93,
[final] ).
cnf(c_0_114,negated_conjecture,
( state(X1,skf8(X1,X4))
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
c_0_94,
[final] ).
cnf(c_0_115,negated_conjecture,
( ssSkP0(X1,X2)
| frontseat(X2,skf11(X2,X3)) ),
clause41,
[final] ).
cnf(c_0_116,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf11(X2,X1),X1) ),
clause42,
[final] ).
cnf(c_0_117,negated_conjecture,
( ssSkC0
| young(skc32,X1)
| ~ member(skc32,X1,skc33) ),
c_0_95,
[final] ).
cnf(c_0_118,negated_conjecture,
( ssSkC0
| fellow(skc32,X1)
| ~ member(skc32,X1,skc33) ),
c_0_96,
[final] ).
cnf(c_0_119,negated_conjecture,
( ssSkC0
| of(skc32,skc37,skc36) ),
clause35,
[final] ).
cnf(c_0_120,negated_conjecture,
( ssSkC0
| in(skc32,skc34,skc36) ),
clause34,
[final] ).
cnf(c_0_121,negated_conjecture,
( of(skc12,skc16,skc15)
| ~ ssSkC0 ),
c_0_97,
[final] ).
cnf(c_0_122,negated_conjecture,
( in(skc12,skc14,skc15)
| ~ ssSkC0 ),
c_0_98,
[final] ).
cnf(c_0_123,negated_conjecture,
( ssSkC0
| agent(skc32,skc34,skc36) ),
clause33,
[final] ).
cnf(c_0_124,negated_conjecture,
( young(skc12,X1)
| ~ member(skc12,X1,skc13)
| ~ ssSkC0 ),
c_0_99,
[final] ).
cnf(c_0_125,negated_conjecture,
( fellow(skc12,X1)
| ~ member(skc12,X1,skc13)
| ~ ssSkC0 ),
c_0_100,
[final] ).
cnf(c_0_126,negated_conjecture,
( ssSkC0
| ssSkP0(skc33,skc32) ),
clause17,
[final] ).
cnf(c_0_127,negated_conjecture,
( ssSkC0
| two(skc32,skc33) ),
clause16,
[final] ).
cnf(c_0_128,negated_conjecture,
( ssSkC0
| group(skc32,skc33) ),
clause15,
[final] ).
cnf(c_0_129,negated_conjecture,
( ssSkC0
| hollywood_placename(skc32,skc37) ),
clause9,
[final] ).
cnf(c_0_130,negated_conjecture,
( ssSkC0
| placename(skc32,skc37) ),
clause8,
[final] ).
cnf(c_0_131,negated_conjecture,
( ssSkP0(skc13,skc12)
| ~ ssSkC0 ),
c_0_101,
[final] ).
cnf(c_0_132,negated_conjecture,
( two(skc12,skc13)
| ~ ssSkC0 ),
c_0_102,
[final] ).
cnf(c_0_133,negated_conjecture,
( group(skc12,skc13)
| ~ ssSkC0 ),
c_0_103,
[final] ).
cnf(c_0_134,negated_conjecture,
( ssSkC0
| old(skc32,skc36) ),
clause7,
[final] ).
cnf(c_0_135,negated_conjecture,
( ssSkC0
| dirty(skc32,skc36) ),
clause6,
[final] ).
cnf(c_0_136,negated_conjecture,
( ssSkC0
| white(skc32,skc36) ),
clause5,
[final] ).
cnf(c_0_137,negated_conjecture,
( hollywood_placename(skc12,skc16)
| ~ ssSkC0 ),
c_0_104,
[final] ).
cnf(c_0_138,negated_conjecture,
( placename(skc12,skc16)
| ~ ssSkC0 ),
c_0_105,
[final] ).
cnf(c_0_139,negated_conjecture,
( ssSkC0
| chevy(skc32,skc36) ),
clause4,
[final] ).
cnf(c_0_140,negated_conjecture,
( ssSkC0
| city(skc32,skc36) ),
clause3,
[final] ).
cnf(c_0_141,negated_conjecture,
( city(skc12,skc15)
| ~ ssSkC0 ),
c_0_106,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP131-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 21:39:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6007 completed with status 1
% 0.20/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHNF-FFMM22-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6013 completed with status 1
% 0.20/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHNF-FFMM22-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # No proof found!
% 0.20/0.50 # SZS status Satisfiable
% 0.20/0.50 # SZS output start Saturation
% See solution above
% 0.20/0.50 # Parsed axioms : 54
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 54
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 54
% 0.20/0.50 # Processed clauses : 117
% 0.20/0.50 # ...of these trivial : 2
% 0.20/0.50 # ...subsumed : 4
% 0.20/0.50 # ...remaining for further processing : 111
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 12
% 0.20/0.50 # ...of the previous two non-redundant : 9
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 14
% 0.20/0.50 # Paramodulations : 12
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # ...of those cached : 2
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 57
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 55
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 54
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 3016
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 931
% 0.20/0.50 # Non-unit clause-clause subsumptions : 18
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3331
% 0.20/0.50 # Search garbage collected termcells : 225
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.012 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1792 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.057 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.063 s
% 0.20/0.50 # Maximum resident set size: 1752 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------