TSTP Solution File: NLP126-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP126-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:37 EDT 2023
% Result : Satisfiable 0.17s 0.45s
% Output : Saturation 0.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause35)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_52,axiom,
( ~ general(X1,X2)
| ~ specific(X1,X2) ),
clause33,
[final] ).
cnf(c_0_53,axiom,
( general(X1,X2)
| ~ abstraction(X1,X2) ),
clause23,
[final] ).
cnf(c_0_54,axiom,
( abstraction(X1,X2)
| ~ relation(X1,X2) ),
clause20,
[final] ).
cnf(c_0_55,axiom,
( relation(X1,X2)
| ~ relname(X1,X2) ),
clause19,
[final] ).
cnf(c_0_56,axiom,
( instrumentality(X1,X2)
| ~ transport(X1,X2) ),
clause31,
[final] ).
cnf(c_0_57,axiom,
( transport(X1,X2)
| ~ vehicle(X1,X2) ),
clause30,
[final] ).
cnf(c_0_58,plain,
( ~ abstraction(X1,X2)
| ~ specific(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]),
[final] ).
cnf(c_0_59,axiom,
( specific(X1,X2)
| ~ entity(X1,X2) ),
clause13,
[final] ).
cnf(c_0_60,plain,
( abstraction(X1,X2)
| ~ relname(X1,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]),
[final] ).
cnf(c_0_61,axiom,
( relname(X1,X2)
| ~ placename(X1,X2) ),
clause18,
[final] ).
cnf(c_0_62,axiom,
( ~ nonexistent(X1,X2)
| ~ existent(X1,X2) ),
clause34,
[final] ).
cnf(c_0_63,axiom,
( existent(X1,X2)
| ~ entity(X1,X2) ),
clause14,
[final] ).
cnf(c_0_64,plain,
( instrumentality(X1,X2)
| ~ vehicle(X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]),
[final] ).
cnf(c_0_65,axiom,
( vehicle(X1,X2)
| ~ car(X1,X2) ),
clause29,
[final] ).
cnf(c_0_66,plain,
( ~ abstraction(X1,X2)
| ~ entity(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[final] ).
cnf(c_0_67,plain,
( abstraction(X1,X2)
| ~ placename(X1,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]),
[final] ).
cnf(c_0_68,axiom,
( specific(X1,X2)
| ~ eventuality(X1,X2) ),
clause5,
[final] ).
cnf(c_0_69,plain,
( ~ entity(X1,X2)
| ~ nonexistent(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]),
[final] ).
cnf(c_0_70,axiom,
( nonexistent(X1,X2)
| ~ eventuality(X1,X2) ),
clause6,
[final] ).
cnf(c_0_71,plain,
( instrumentality(X1,X2)
| ~ car(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[final] ).
cnf(c_0_72,axiom,
( car(X1,X2)
| ~ chevy(X1,X2) ),
clause28,
[final] ).
cnf(c_0_73,axiom,
( artifact(X1,X2)
| ~ way(X1,X2) ),
clause9,
[final] ).
cnf(c_0_74,axiom,
( way(X1,X2)
| ~ street(X1,X2) ),
clause8,
[final] ).
cnf(c_0_75,plain,
( ~ placename(X1,X2)
| ~ entity(X1,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]),
[final] ).
cnf(c_0_76,axiom,
( entity(X1,X2)
| ~ object(X1,X2) ),
clause11,
[final] ).
cnf(c_0_77,plain,
( ~ abstraction(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_68]),
[final] ).
cnf(c_0_78,axiom,
( eventuality(X1,X2)
| ~ event(X1,X2) ),
clause2,
[final] ).
cnf(c_0_79,negated_conjecture,
event(skc5,skc6),
clause48,
[final] ).
cnf(c_0_80,plain,
( ~ entity(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]),
[final] ).
cnf(c_0_81,axiom,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
clause32,
[final] ).
cnf(c_0_82,plain,
( instrumentality(X1,X2)
| ~ chevy(X1,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]),
[final] ).
cnf(c_0_83,axiom,
( object(X1,X2)
| ~ location(X1,X2) ),
clause27,
[final] ).
cnf(c_0_84,axiom,
( location(X1,X2)
| ~ city(X1,X2) ),
clause26,
[final] ).
cnf(c_0_85,plain,
( artifact(X1,X2)
| ~ street(X1,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]),
[final] ).
cnf(c_0_86,negated_conjecture,
street(skc5,skc9),
clause37,
[final] ).
cnf(c_0_87,axiom,
( X3 = X2
| ~ placename(X1,X2)
| ~ of(X1,X3,X4)
| ~ placename(X1,X3)
| ~ of(X1,X2,X4)
| ~ entity(X1,X4) ),
clause35,
[final] ).
cnf(c_0_88,negated_conjecture,
of(skc5,skc8,skc7),
clause49,
[final] ).
cnf(c_0_89,negated_conjecture,
placename(skc5,skc8),
clause38,
[final] ).
cnf(c_0_90,plain,
( ~ placename(X1,X2)
| ~ object(X1,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]),
[final] ).
cnf(c_0_91,plain,
( ~ placename(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_67]),
[final] ).
cnf(c_0_92,negated_conjecture,
eventuality(skc5,skc6),
inference(spm,[status(thm)],[c_0_78,c_0_79]),
[final] ).
cnf(c_0_93,plain,
( ~ object(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_80,c_0_76]),
[final] ).
cnf(c_0_94,plain,
( artifact(X1,X2)
| ~ chevy(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]),
[final] ).
cnf(c_0_95,negated_conjecture,
chevy(skc5,skc7),
clause41,
[final] ).
cnf(c_0_96,plain,
( object(X1,X2)
| ~ city(X1,X2) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]),
[final] ).
cnf(c_0_97,negated_conjecture,
city(skc5,skc7),
clause40,
[final] ).
cnf(c_0_98,axiom,
( object(X1,X2)
| ~ artifact(X1,X2) ),
clause10,
[final] ).
cnf(c_0_99,negated_conjecture,
artifact(skc5,skc9),
inference(spm,[status(thm)],[c_0_85,c_0_86]),
[final] ).
cnf(c_0_100,negated_conjecture,
( X1 = skc8
| ~ of(skc5,X1,skc7)
| ~ placename(skc5,X1)
| ~ entity(skc5,skc7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]),
[final] ).
cnf(c_0_101,axiom,
( nonhuman(X1,X2)
| ~ abstraction(X1,X2) ),
clause22,
[final] ).
cnf(c_0_102,axiom,
( impartial(X1,X2)
| ~ object(X1,X2) ),
clause16,
[final] ).
cnf(c_0_103,axiom,
( nonliving(X1,X2)
| ~ object(X1,X2) ),
clause15,
[final] ).
cnf(c_0_104,axiom,
( unisex(X1,X2)
| ~ abstraction(X1,X2) ),
clause24,
[final] ).
cnf(c_0_105,axiom,
( unisex(X1,X2)
| ~ object(X1,X2) ),
clause17,
[final] ).
cnf(c_0_106,axiom,
( unisex(X1,X2)
| ~ eventuality(X1,X2) ),
clause7,
[final] ).
cnf(c_0_107,axiom,
( singleton(X1,X2)
| ~ thing(X1,X2) ),
clause4,
[final] ).
cnf(c_0_108,axiom,
( thing(X1,X2)
| ~ abstraction(X1,X2) ),
clause21,
[final] ).
cnf(c_0_109,axiom,
( thing(X1,X2)
| ~ entity(X1,X2) ),
clause12,
[final] ).
cnf(c_0_110,axiom,
( thing(X1,X2)
| ~ eventuality(X1,X2) ),
clause3,
[final] ).
cnf(c_0_111,axiom,
( placename(X1,X2)
| ~ hollywood_placename(X1,X2) ),
clause25,
[final] ).
cnf(c_0_112,axiom,
( event(X1,X2)
| ~ barrel(X1,X2) ),
clause1,
[final] ).
cnf(c_0_113,negated_conjecture,
~ object(skc5,skc8),
inference(spm,[status(thm)],[c_0_90,c_0_89]),
[final] ).
cnf(c_0_114,negated_conjecture,
~ placename(skc5,skc6),
inference(spm,[status(thm)],[c_0_91,c_0_92]),
[final] ).
cnf(c_0_115,negated_conjecture,
~ object(skc5,skc6),
inference(spm,[status(thm)],[c_0_93,c_0_92]),
[final] ).
cnf(c_0_116,negated_conjecture,
artifact(skc5,skc7),
inference(spm,[status(thm)],[c_0_94,c_0_95]),
[final] ).
cnf(c_0_117,negated_conjecture,
object(skc5,skc7),
inference(spm,[status(thm)],[c_0_96,c_0_97]),
[final] ).
cnf(c_0_118,negated_conjecture,
object(skc5,skc9),
inference(spm,[status(thm)],[c_0_98,c_0_99]),
[final] ).
cnf(c_0_119,negated_conjecture,
down(skc5,skc6,skc9),
clause52,
[final] ).
cnf(c_0_120,negated_conjecture,
in(skc5,skc6,skc7),
clause51,
[final] ).
cnf(c_0_121,negated_conjecture,
agent(skc5,skc6,skc7),
clause50,
[final] ).
cnf(c_0_122,negated_conjecture,
present(skc5,skc6),
clause47,
[final] ).
cnf(c_0_123,negated_conjecture,
lonely(skc5,skc9),
clause45,
[final] ).
cnf(c_0_124,negated_conjecture,
old(skc5,skc7),
clause44,
[final] ).
cnf(c_0_125,negated_conjecture,
dirty(skc5,skc7),
clause43,
[final] ).
cnf(c_0_126,negated_conjecture,
white(skc5,skc7),
clause42,
[final] ).
cnf(c_0_127,negated_conjecture,
hollywood_placename(skc5,skc8),
clause39,
[final] ).
cnf(c_0_128,negated_conjecture,
barrel(skc5,skc6),
clause46,
[final] ).
cnf(c_0_129,negated_conjecture,
actual_world(skc5),
clause36,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP126-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 11:18:36 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.iIqW2GizfO/E---3.1_26320.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26493 completed with status 1
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FHHSF-FFMM00-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.45 # Starting sh5l with 136s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 26497 completed with status 1
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FHHSF-FFMM00-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.45 # Preprocessing time : 0.002 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # No proof found!
% 0.17/0.45 # SZS status Satisfiable
% 0.17/0.45 # SZS output start Saturation
% See solution above
% 0.17/0.45 # Parsed axioms : 52
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 52
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 52
% 0.17/0.45 # Processed clauses : 130
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 130
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 29
% 0.17/0.45 # ...of the previous two non-redundant : 26
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 29
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 4
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 78
% 0.17/0.45 # Positive orientable unit clauses : 22
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 3
% 0.17/0.45 # Non-unit-clauses : 53
% 0.17/0.45 # Current number of unprocessed clauses: 0
% 0.17/0.45 # ...number of literals in the above : 0
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 52
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 1331
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 1173
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 17
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 1250
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.006 s
% 0.17/0.45 # System time : 0.003 s
% 0.17/0.45 # Total time : 0.009 s
% 0.17/0.45 # Maximum resident set size: 1684 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.026 s
% 0.17/0.45 # System time : 0.012 s
% 0.17/0.45 # Total time : 0.038 s
% 0.17/0.45 # Maximum resident set size: 1732 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------