TSTP Solution File: NLP119-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP119-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:44:34 EDT 2023
% Result : Satisfiable 0.21s 0.50s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause35)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_36,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) ),
clause35,
[final] ).
cnf(c_0_37,negated_conjecture,
( ssSkC0
| down(skc16,skc17,skc18) ),
clause30,
[final] ).
cnf(c_0_38,negated_conjecture,
actual_world(skc16),
clause1,
[final] ).
cnf(c_0_40,negated_conjecture,
( ssSkC0
| lonely(skc16,skc18) ),
clause14,
[final] ).
cnf(c_0_42,negated_conjecture,
( ssSkC0
| street(skc16,skc18) ),
clause13,
[final] ).
cnf(c_0_44,negated_conjecture,
( ssSkC0
| event(skc16,skc17) ),
clause9,
[final] ).
cnf(c_0_46,negated_conjecture,
( ssSkC0
| present(skc16,skc17) ),
clause8,
[final] ).
cnf(c_0_48,negated_conjecture,
( ssSkC0
| barrel(skc16,skc17) ),
clause7,
[final] ).
cnf(c_0_49,negated_conjecture,
( ssSkC0
| ~ of(skc16,X1,X2)
| ~ in(skc16,skc17,X2)
| ~ agent(skc16,skc17,X2)
| ~ city(skc16,X2)
| ~ placename(skc16,X1)
| ~ hollywood_placename(skc16,X1)
| ~ chevy(skc16,X2)
| ~ white(skc16,X2)
| ~ dirty(skc16,X2)
| ~ old(skc16,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]),
[final] ).
cnf(c_0_50,negated_conjecture,
( ssSkC0
| in(skc16,skc17,skc20) ),
clause28,
[final] ).
cnf(c_0_52,negated_conjecture,
( ssSkC0
| city(skc16,skc20) ),
clause12,
[final] ).
cnf(c_0_53,negated_conjecture,
( ssSkC0
| ~ of(skc16,X1,skc20)
| ~ agent(skc16,skc17,skc20)
| ~ placename(skc16,X1)
| ~ hollywood_placename(skc16,X1)
| ~ chevy(skc16,skc20)
| ~ white(skc16,skc20)
| ~ dirty(skc16,skc20)
| ~ old(skc16,skc20) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]),
[final] ).
cnf(c_0_54,negated_conjecture,
( down(skc11,skc12,skc15)
| ~ ssSkC0 ),
clause31,
[final] ).
cnf(c_0_55,negated_conjecture,
( of(skc11,skc14,skc13)
| ~ ssSkC0 ),
clause34,
[final] ).
cnf(c_0_56,negated_conjecture,
( in(skc11,skc12,skc13)
| ~ ssSkC0 ),
clause32,
[final] ).
cnf(c_0_57,negated_conjecture,
( agent(skc11,skc12,skc13)
| ~ ssSkC0 ),
clause33,
[final] ).
cnf(c_0_58,negated_conjecture,
( ssSkC0
| of(skc16,skc19,skc20) ),
clause29,
[final] ).
cnf(c_0_59,negated_conjecture,
( ssSkC0
| agent(skc16,skc17,skc21) ),
clause27,
[final] ).
cnf(c_0_60,negated_conjecture,
( lonely(skc11,skc15)
| ~ ssSkC0 ),
clause18,
[final] ).
cnf(c_0_61,negated_conjecture,
( street(skc11,skc15)
| ~ ssSkC0 ),
clause19,
[final] ).
cnf(c_0_62,negated_conjecture,
( city(skc11,skc13)
| ~ ssSkC0 ),
clause24,
[final] ).
cnf(c_0_63,negated_conjecture,
( placename(skc11,skc14)
| ~ ssSkC0 ),
clause26,
[final] ).
cnf(c_0_64,negated_conjecture,
( hollywood_placename(skc11,skc14)
| ~ ssSkC0 ),
clause25,
[final] ).
cnf(c_0_65,negated_conjecture,
( event(skc11,skc12)
| ~ ssSkC0 ),
clause15,
[final] ).
cnf(c_0_66,negated_conjecture,
( present(skc11,skc12)
| ~ ssSkC0 ),
clause16,
[final] ).
cnf(c_0_67,negated_conjecture,
( barrel(skc11,skc12)
| ~ ssSkC0 ),
clause17,
[final] ).
cnf(c_0_68,negated_conjecture,
( chevy(skc11,skc13)
| ~ ssSkC0 ),
clause23,
[final] ).
cnf(c_0_69,negated_conjecture,
( white(skc11,skc13)
| ~ ssSkC0 ),
clause22,
[final] ).
cnf(c_0_70,negated_conjecture,
( dirty(skc11,skc13)
| ~ ssSkC0 ),
clause21,
[final] ).
cnf(c_0_71,negated_conjecture,
( old(skc11,skc13)
| ~ ssSkC0 ),
clause20,
[final] ).
cnf(c_0_72,negated_conjecture,
( ssSkC0
| placename(skc16,skc19) ),
clause11,
[final] ).
cnf(c_0_73,negated_conjecture,
( ssSkC0
| hollywood_placename(skc16,skc19) ),
clause10,
[final] ).
cnf(c_0_74,negated_conjecture,
( ssSkC0
| chevy(skc16,skc21) ),
clause6,
[final] ).
cnf(c_0_75,negated_conjecture,
( ssSkC0
| white(skc16,skc21) ),
clause5,
[final] ).
cnf(c_0_76,negated_conjecture,
( ssSkC0
| dirty(skc16,skc21) ),
clause4,
[final] ).
cnf(c_0_77,negated_conjecture,
( ssSkC0
| old(skc16,skc21) ),
clause3,
[final] ).
cnf(c_0_78,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 ),
clause36,
[final] ).
cnf(c_0_79,negated_conjecture,
actual_world(skc11),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP119-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.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 : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 11:33:14 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.XnjtBdkXJs/E---3.1_15370.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_1 with pid 15574 completed with status 1
% 0.21/0.50 # Result found by new_bool_1
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.50 # H----_011_C07_F1_PI_AE_OS_S1U with pid 15580 completed with status 1
% 0.21/0.50 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # No proof found!
% 0.21/0.50 # SZS status Satisfiable
% 0.21/0.50 # SZS output start Saturation
% See solution above
% 0.21/0.50 # Parsed axioms : 36
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 36
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 36
% 0.21/0.50 # Processed clauses : 45
% 0.21/0.50 # ...of these trivial : 1
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 44
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 6
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 9
% 0.21/0.50 # ...of the previous two non-redundant : 9
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 9
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 2
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 38
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 36
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 6
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 72
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 59
% 0.21/0.50 # Non-unit clause-clause subsumptions : 6
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1608
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1800 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.007 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1732 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------