TSTP Solution File: NLP119-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP119-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:28 EDT 2024
% Result : Satisfiable 0.21s 0.49s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_36)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_37,negated_conjecture,
( ssSkC0
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ down(X1,X2,X3)
| ~ lonely(X1,X3)
| ~ street(X1,X3)
| ~ in(X1,X2,X4)
| ~ agent(X1,X2,X4)
| ~ old(X1,X4)
| ~ dirty(X1,X4)
| ~ white(X1,X4)
| ~ chevy(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ actual_world(X1) ),
c_0_36,
[final] ).
cnf(c_0_38,negated_conjecture,
( ssSkC0
| agent(skc16,skc17,skc21) ),
clause27,
[final] ).
cnf(c_0_39,negated_conjecture,
actual_world(skc16),
clause1,
[final] ).
cnf(c_0_40,negated_conjecture,
( ssSkC0
| old(skc16,skc21) ),
clause3,
[final] ).
cnf(c_0_41,negated_conjecture,
( ssSkC0
| dirty(skc16,skc21) ),
clause4,
[final] ).
cnf(c_0_42,negated_conjecture,
( ssSkC0
| white(skc16,skc21) ),
clause5,
[final] ).
cnf(c_0_43,negated_conjecture,
( ssSkC0
| chevy(skc16,skc21) ),
clause6,
[final] ).
cnf(c_0_44,negated_conjecture,
( ssSkC0
| barrel(skc16,skc17) ),
clause7,
[final] ).
cnf(c_0_45,negated_conjecture,
( ssSkC0
| present(skc16,skc17) ),
clause8,
[final] ).
cnf(c_0_46,negated_conjecture,
( ssSkC0
| event(skc16,skc17) ),
clause9,
[final] ).
cnf(c_0_48,negated_conjecture,
( ssSkC0
| down(skc16,skc17,skc18) ),
clause30,
[final] ).
cnf(c_0_49,negated_conjecture,
( ssSkC0
| street(skc16,skc18) ),
clause13,
[final] ).
cnf(c_0_50,negated_conjecture,
( ssSkC0
| lonely(skc16,skc18) ),
clause14,
[final] ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| ~ of(skc16,X1,skc21)
| ~ in(skc16,skc17,skc21)
| ~ city(skc16,skc21)
| ~ placename(skc16,X1)
| ~ hollywood_placename(skc16,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]),
[final] ).
cnf(c_0_69,negated_conjecture,
( ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ street(X1,X6)
| ~ lonely(X1,X6)
| ~ down(X1,X2,X6)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_51,
[final] ).
cnf(c_0_70,negated_conjecture,
( ssSkC0
| of(skc16,skc19,skc20) ),
clause29,
[final] ).
cnf(c_0_71,negated_conjecture,
( down(skc11,skc12,skc15)
| ~ ssSkC0 ),
c_0_52,
[final] ).
cnf(c_0_72,negated_conjecture,
( of(skc11,skc14,skc13)
| ~ ssSkC0 ),
c_0_53,
[final] ).
cnf(c_0_73,negated_conjecture,
( in(skc11,skc12,skc13)
| ~ ssSkC0 ),
c_0_54,
[final] ).
cnf(c_0_74,negated_conjecture,
( agent(skc11,skc12,skc13)
| ~ ssSkC0 ),
c_0_55,
[final] ).
cnf(c_0_75,negated_conjecture,
( ssSkC0
| in(skc16,skc17,skc20) ),
clause28,
[final] ).
cnf(c_0_76,negated_conjecture,
( ssSkC0
| city(skc16,skc20) ),
clause12,
[final] ).
cnf(c_0_77,negated_conjecture,
( ssSkC0
| placename(skc16,skc19) ),
clause11,
[final] ).
cnf(c_0_78,negated_conjecture,
( ssSkC0
| hollywood_placename(skc16,skc19) ),
clause10,
[final] ).
cnf(c_0_79,negated_conjecture,
( lonely(skc11,skc15)
| ~ ssSkC0 ),
c_0_56,
[final] ).
cnf(c_0_80,negated_conjecture,
( street(skc11,skc15)
| ~ ssSkC0 ),
c_0_57,
[final] ).
cnf(c_0_81,negated_conjecture,
( city(skc11,skc13)
| ~ ssSkC0 ),
c_0_58,
[final] ).
cnf(c_0_82,negated_conjecture,
( placename(skc11,skc14)
| ~ ssSkC0 ),
c_0_59,
[final] ).
cnf(c_0_83,negated_conjecture,
( hollywood_placename(skc11,skc14)
| ~ ssSkC0 ),
c_0_60,
[final] ).
cnf(c_0_84,negated_conjecture,
( event(skc11,skc12)
| ~ ssSkC0 ),
c_0_61,
[final] ).
cnf(c_0_85,negated_conjecture,
( present(skc11,skc12)
| ~ ssSkC0 ),
c_0_62,
[final] ).
cnf(c_0_86,negated_conjecture,
( barrel(skc11,skc12)
| ~ ssSkC0 ),
c_0_63,
[final] ).
cnf(c_0_87,negated_conjecture,
( chevy(skc11,skc13)
| ~ ssSkC0 ),
c_0_64,
[final] ).
cnf(c_0_88,negated_conjecture,
( white(skc11,skc13)
| ~ ssSkC0 ),
c_0_65,
[final] ).
cnf(c_0_89,negated_conjecture,
( dirty(skc11,skc13)
| ~ ssSkC0 ),
c_0_66,
[final] ).
cnf(c_0_90,negated_conjecture,
( old(skc11,skc13)
| ~ ssSkC0 ),
c_0_67,
[final] ).
cnf(c_0_91,negated_conjecture,
actual_world(skc11),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP119-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 22:30:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 31420 completed with status 1
% 0.21/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 811s (1) cores
% 0.21/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.49 # Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.21/0.49 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.49 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 31429 completed with status 1
% 0.21/0.49 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.21/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 811s (1) cores
% 0.21/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.49 # Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.21/0.49 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49
% 0.21/0.49 # No proof found!
% 0.21/0.49 # SZS status Satisfiable
% 0.21/0.49 # SZS output start Saturation
% See solution above
% 0.21/0.49 # Parsed axioms : 36
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 36
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 36
% 0.21/0.49 # Processed clauses : 39
% 0.21/0.49 # ...of these trivial : 1
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 38
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 1
% 0.21/0.49 # Backward-rewritten : 0
% 0.21/0.49 # Generated clauses : 3
% 0.21/0.49 # ...of the previous two non-redundant : 3
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 9
% 0.21/0.49 # Paramodulations : 3
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 2
% 0.21/0.49 # ...of those cached : 1
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 37
% 0.21/0.49 # Positive orientable unit clauses : 2
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 35
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 1
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 97
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 64
% 0.21/0.49 # Non-unit clause-clause subsumptions : 10
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 0
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 1266
% 0.21/0.49 # Search garbage collected termcells : 111
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1688 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.018 s
% 0.21/0.49 # System time : 0.011 s
% 0.21/0.49 # Total time : 0.029 s
% 0.21/0.49 # Maximum resident set size: 1756 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------