TSTP Solution File: NLP110-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP110-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:42:16 EDT 2023
% Result : Satisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause12)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_49,axiom,
( ~ nonexistent(X1,X2)
| ~ existent(X1,X2) ),
clause31,
[final] ).
cnf(c_0_50,axiom,
( existent(X1,X2)
| ~ entity(X1,X2) ),
clause16,
[final] ).
cnf(c_0_51,plain,
( ~ entity(X1,X2)
| ~ nonexistent(X1,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]),
[final] ).
cnf(c_0_52,axiom,
( nonexistent(X1,X2)
| ~ eventuality(X1,X2) ),
clause6,
[final] ).
cnf(c_0_53,axiom,
( entity(X1,X2)
| ~ organism(X1,X2) ),
clause21,
[final] ).
cnf(c_0_54,axiom,
( organism(X1,X2)
| ~ human_person(X1,X2) ),
clause20,
[final] ).
cnf(c_0_55,axiom,
( ~ nonliving(X1,X2)
| ~ animate(X1,X2) ),
clause32,
[final] ).
cnf(c_0_56,axiom,
( animate(X1,X2)
| ~ human_person(X1,X2) ),
clause25,
[final] ).
cnf(c_0_57,axiom,
( object(X1,X2)
| ~ substance_matter(X1,X2) ),
clause12,
[final] ).
cnf(c_0_58,axiom,
( substance_matter(X1,X2)
| ~ food(X1,X2) ),
clause11,
[final] ).
cnf(c_0_59,plain,
( ~ entity(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]),
[final] ).
cnf(c_0_60,plain,
( entity(X1,X2)
| ~ human_person(X1,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_61,axiom,
( entity(X1,X2)
| ~ object(X1,X2) ),
clause13,
[final] ).
cnf(c_0_62,plain,
( ~ human_person(X1,X2)
| ~ nonliving(X1,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]),
[final] ).
cnf(c_0_63,axiom,
( nonliving(X1,X2)
| ~ object(X1,X2) ),
clause17,
[final] ).
cnf(c_0_64,axiom,
( artifact(X1,X2)
| ~ building(X1,X2) ),
clause28,
[final] ).
cnf(c_0_65,axiom,
( building(X1,X2)
| ~ restaurant(X1,X2) ),
clause27,
[final] ).
cnf(c_0_66,plain,
( object(X1,X2)
| ~ food(X1,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]),
[final] ).
cnf(c_0_67,axiom,
( food(X1,X2)
| ~ beverage(X1,X2) ),
clause10,
[final] ).
cnf(c_0_68,axiom,
( beverage(X1,X2)
| ~ coffee(X1,X2) ),
clause9,
[final] ).
cnf(c_0_69,negated_conjecture,
coffee(skc4,skc8),
clause36,
[final] ).
cnf(c_0_70,plain,
( ~ human_person(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]),
[final] ).
cnf(c_0_71,axiom,
( eventuality(X1,X2)
| ~ event(X1,X2) ),
clause2,
[final] ).
cnf(c_0_72,plain,
( ~ object(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_61]),
[final] ).
cnf(c_0_73,axiom,
( beverage(X1,X3)
| ~ drink(X1,X2)
| ~ patient(X1,X2,X3)
| ~ agent(X1,X2,X4) ),
clause34,
[final] ).
cnf(c_0_74,negated_conjecture,
agent(skc4,skc5,skc6),
clause42,
[final] ).
cnf(c_0_75,negated_conjecture,
drink(skc4,skc5),
clause41,
[final] ).
cnf(c_0_76,axiom,
( ~ living(X1,X2)
| ~ nonliving(X1,X2) ),
clause30,
[final] ).
cnf(c_0_77,axiom,
( living(X1,X2)
| ~ organism(X1,X2) ),
clause23,
[final] ).
cnf(c_0_78,plain,
( ~ human_person(X1,X2)
| ~ object(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]),
[final] ).
cnf(c_0_79,axiom,
( human_person(X1,X2)
| ~ customer(X1,X2) ),
clause26,
[final] ).
cnf(c_0_80,axiom,
( object(X1,X2)
| ~ artifact(X1,X2) ),
clause29,
[final] ).
cnf(c_0_81,plain,
( artifact(X1,X2)
| ~ restaurant(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[final] ).
cnf(c_0_82,plain,
( object(X1,X2)
| ~ beverage(X1,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]),
[final] ).
cnf(c_0_83,negated_conjecture,
beverage(skc4,skc8),
inference(spm,[status(thm)],[c_0_68,c_0_69]),
[final] ).
cnf(c_0_84,negated_conjecture,
human_person(skc4,skc6),
clause37,
[final] ).
cnf(c_0_85,plain,
( ~ human_person(X1,X2)
| ~ event(X1,X2) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]),
[final] ).
cnf(c_0_86,plain,
( ~ object(X1,X2)
| ~ event(X1,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_71]),
[final] ).
cnf(c_0_87,negated_conjecture,
event(skc4,skc5),
clause38,
[final] ).
cnf(c_0_88,negated_conjecture,
( beverage(skc4,X1)
| ~ patient(skc4,skc5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]),
[final] ).
cnf(c_0_89,plain,
( ~ organism(X1,X2)
| ~ nonliving(X1,X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]),
[final] ).
cnf(c_0_90,plain,
( ~ customer(X1,X2)
| ~ object(X1,X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]),
[final] ).
cnf(c_0_91,plain,
( object(X1,X2)
| ~ restaurant(X1,X2) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]),
[final] ).
cnf(c_0_92,negated_conjecture,
object(skc4,skc8),
inference(spm,[status(thm)],[c_0_82,c_0_83]),
[final] ).
cnf(c_0_93,axiom,
( ~ nonreflexive(X1,X2)
| ~ patient(X1,X2,X3)
| ~ agent(X1,X2,X3) ),
clause33,
[final] ).
cnf(c_0_94,negated_conjecture,
nonreflexive(skc4,skc5),
clause40,
[final] ).
cnf(c_0_95,negated_conjecture,
~ object(skc4,skc6),
inference(spm,[status(thm)],[c_0_78,c_0_84]),
[final] ).
cnf(c_0_96,plain,
( ~ customer(X1,X2)
| ~ event(X1,X2) ),
inference(spm,[status(thm)],[c_0_85,c_0_79]),
[final] ).
cnf(c_0_97,negated_conjecture,
~ object(skc4,skc5),
inference(spm,[status(thm)],[c_0_86,c_0_87]),
[final] ).
cnf(c_0_98,negated_conjecture,
( object(skc4,X1)
| ~ patient(skc4,skc5,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_88]),
[final] ).
cnf(c_0_99,negated_conjecture,
( agent(skc4,skf1(X2),X2)
| ~ restaurant(skc4,X1)
| ~ in(skc4,X2,X1)
| ~ customer(skc4,X2) ),
clause48,
[final] ).
cnf(c_0_100,plain,
( ~ organism(X1,X2)
| ~ object(X1,X2) ),
inference(spm,[status(thm)],[c_0_89,c_0_63]),
[final] ).
cnf(c_0_101,axiom,
( impartial(X1,X2)
| ~ organism(X1,X2) ),
clause22,
[final] ).
cnf(c_0_102,plain,
( ~ restaurant(X1,X2)
| ~ customer(X1,X2) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_103,axiom,
( impartial(X1,X2)
| ~ object(X1,X2) ),
clause18,
[final] ).
cnf(c_0_104,axiom,
( unisex(X1,X2)
| ~ object(X1,X2) ),
clause19,
[final] ).
cnf(c_0_105,negated_conjecture,
( patient(skc4,skf1(X3),skc6)
| ~ restaurant(skc4,X1)
| ~ in(skc4,X2,X1)
| ~ customer(skc4,X2) ),
clause49,
[final] ).
cnf(c_0_106,axiom,
( unisex(X1,X2)
| ~ eventuality(X1,X2) ),
clause7,
[final] ).
cnf(c_0_107,axiom,
( specific(X1,X2)
| ~ entity(X1,X2) ),
clause15,
[final] ).
cnf(c_0_108,axiom,
( specific(X1,X2)
| ~ eventuality(X1,X2) ),
clause5,
[final] ).
cnf(c_0_109,axiom,
( singleton(X1,X2)
| ~ thing(X1,X2) ),
clause4,
[final] ).
cnf(c_0_110,axiom,
( thing(X1,X2)
| ~ entity(X1,X2) ),
clause14,
[final] ).
cnf(c_0_111,negated_conjecture,
( past(skc4,skf1(X3))
| ~ restaurant(skc4,X1)
| ~ in(skc4,X2,X1)
| ~ customer(skc4,X2) ),
clause45,
[final] ).
cnf(c_0_112,axiom,
( thing(X1,X2)
| ~ eventuality(X1,X2) ),
clause3,
[final] ).
cnf(c_0_113,axiom,
( human(X1,X2)
| ~ human_person(X1,X2) ),
clause24,
[final] ).
cnf(c_0_114,negated_conjecture,
( nonreflexive(skc4,skf1(X3))
| ~ restaurant(skc4,X1)
| ~ in(skc4,X2,X1)
| ~ customer(skc4,X2) ),
clause46,
[final] ).
cnf(c_0_115,negated_conjecture,
( event(skc4,skf1(X3))
| ~ restaurant(skc4,X1)
| ~ in(skc4,X2,X1)
| ~ customer(skc4,X2) ),
clause44,
[final] ).
cnf(c_0_116,negated_conjecture,
( see(skc4,skf1(X3))
| ~ restaurant(skc4,X1)
| ~ in(skc4,X2,X1)
| ~ customer(skc4,X2) ),
clause47,
[final] ).
cnf(c_0_117,axiom,
( event(X1,X2)
| ~ drink(X1,X2) ),
clause8,
[final] ).
cnf(c_0_118,axiom,
( event(X1,X2)
| ~ see(X1,X2) ),
clause1,
[final] ).
cnf(c_0_119,negated_conjecture,
~ customer(skc4,skc8),
inference(spm,[status(thm)],[c_0_90,c_0_92]),
[final] ).
cnf(c_0_120,negated_conjecture,
~ patient(skc4,skc5,skc6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_74]),c_0_94])]),
[final] ).
cnf(c_0_121,negated_conjecture,
~ restaurant(skc4,skc6),
inference(spm,[status(thm)],[c_0_95,c_0_91]),
[final] ).
cnf(c_0_122,negated_conjecture,
~ customer(skc4,skc5),
inference(spm,[status(thm)],[c_0_96,c_0_87]),
[final] ).
cnf(c_0_123,negated_conjecture,
~ event(skc4,skc6),
inference(spm,[status(thm)],[c_0_85,c_0_84]),
[final] ).
cnf(c_0_124,negated_conjecture,
~ restaurant(skc4,skc5),
inference(spm,[status(thm)],[c_0_97,c_0_91]),
[final] ).
cnf(c_0_125,negated_conjecture,
patient(skc4,skc5,skc8),
clause43,
[final] ).
cnf(c_0_126,negated_conjecture,
past(skc4,skc5),
clause39,
[final] ).
cnf(c_0_127,negated_conjecture,
actual_world(skc4),
clause35,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NLP110-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:08:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.wF9AEKuOHK/E---3.1_20176.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 20257 completed with status 1
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FHHNF-FFMM11-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 20264 completed with status 1
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FHHNF-FFMM11-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # No proof found!
% 0.20/0.51 # SZS status Satisfiable
% 0.20/0.51 # SZS output start Saturation
% See solution above
% 0.20/0.51 # Parsed axioms : 49
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 49
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 49
% 0.20/0.51 # Processed clauses : 129
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 1
% 0.20/0.51 # ...remaining for further processing : 128
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 33
% 0.20/0.51 # ...of the previous two non-redundant : 31
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 33
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 4
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 79
% 0.20/0.51 # Positive orientable unit clauses : 11
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 8
% 0.20/0.51 # Non-unit-clauses : 60
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 49
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1429
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 1077
% 0.20/0.51 # Non-unit clause-clause subsumptions : 1
% 0.20/0.51 # Unit Clause-clause subsumption calls : 82
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1583
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.006 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.009 s
% 0.20/0.51 # Maximum resident set size: 1832 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.009 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.013 s
% 0.20/0.51 # Maximum resident set size: 1728 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------