TSTP Solution File: NLP040-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP040-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:43:54 EDT 2023
% Result : Satisfiable 0.18s 0.47s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause49)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_66,axiom,
( set(X1,X2)
| ~ group(X1,X2) ),
clause15,
[final] ).
cnf(c_0_67,negated_conjecture,
group(skc2,skc3),
clause54,
[final] ).
cnf(c_0_68,axiom,
( multiple(X1,X2)
| ~ set(X1,X2) ),
clause16,
[final] ).
cnf(c_0_69,negated_conjecture,
set(skc2,skc3),
inference(spm,[status(thm)],[c_0_66,c_0_67]),
[final] ).
cnf(c_0_70,axiom,
( ~ multiple(X1,X2)
| ~ singleton(X1,X2) ),
clause38,
[final] ).
cnf(c_0_71,negated_conjecture,
multiple(skc2,skc3),
inference(spm,[status(thm)],[c_0_68,c_0_69]),
[final] ).
cnf(c_0_72,axiom,
( three(X6,X7)
| X1 = X9
| X1 = X8
| X8 = X9
| skf19(X1,X2,X3,X4,X5) != X1
| ~ member(X6,X1,X7)
| ~ member(X6,X8,X7)
| ~ member(X6,X9,X7) ),
clause49,
[final] ).
cnf(c_0_73,axiom,
( three(X1,X3)
| member(X1,skf19(X2,X4,X5,X3,X1),X3)
| X2 = X5
| X2 = X4
| X4 = X5
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X3)
| ~ member(X1,X5,X3) ),
clause52,
[final] ).
cnf(c_0_74,axiom,
( three(X6,X7)
| X1 = X8
| X1 = X2
| X2 = X8
| skf19(X1,X2,X3,X4,X5) != X2
| ~ member(X6,X1,X7)
| ~ member(X6,X2,X7)
| ~ member(X6,X8,X7) ),
clause50,
[final] ).
cnf(c_0_75,axiom,
( three(X6,X7)
| X1 = X3
| X1 = X2
| X2 = X3
| skf19(X1,X2,X3,X4,X5) != X3
| ~ member(X6,X1,X7)
| ~ member(X6,X2,X7)
| ~ member(X6,X3,X7) ),
clause51,
[final] ).
cnf(c_0_76,negated_conjecture,
( agent(skc2,skf12(X1,X3),X1)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
clause64,
[final] ).
cnf(c_0_77,axiom,
( X2 = skf14(X3,X1)
| X2 = skf16(X3,X1)
| X2 = skf18(X3,X1)
| ~ member(X1,X2,X3)
| ~ three(X1,X3) ),
clause48,
[final] ).
cnf(c_0_78,negated_conjecture,
( at(skc2,skf12(X1,X2),skf11(X2))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
clause66,
[final] ).
cnf(c_0_79,negated_conjecture,
( present(skc2,skf12(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
clause62,
[final] ).
cnf(c_0_80,negated_conjecture,
( event(skc2,skf12(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
clause61,
[final] ).
cnf(c_0_81,negated_conjecture,
( sit(skc2,skf12(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
clause63,
[final] ).
cnf(c_0_82,negated_conjecture,
( with(skc2,skf12(X1,X2),X2)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
clause65,
[final] ).
cnf(c_0_83,axiom,
( member(X1,skf14(X2,X1),X2)
| ~ three(X1,X2) ),
clause44,
[final] ).
cnf(c_0_84,axiom,
( member(X1,skf16(X2,X1),X2)
| ~ three(X1,X2) ),
clause43,
[final] ).
cnf(c_0_85,axiom,
( member(X1,skf18(X2,X1),X2)
| ~ three(X1,X2) ),
clause42,
[final] ).
cnf(c_0_86,axiom,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
clause34,
[final] ).
cnf(c_0_87,axiom,
( nonexistent(X1,X2)
| ~ eventuality(X1,X2) ),
clause31,
[final] ).
cnf(c_0_88,axiom,
( unisex(X1,X2)
| ~ eventuality(X1,X2) ),
clause32,
[final] ).
cnf(c_0_89,axiom,
( unisex(X1,X2)
| ~ object(X1,X2) ),
clause26,
[final] ).
cnf(c_0_90,axiom,
( nonliving(X1,X2)
| ~ object(X1,X2) ),
clause24,
[final] ).
cnf(c_0_91,axiom,
( substance_matter(X1,X2)
| ~ food(X1,X2) ),
clause21,
[final] ).
cnf(c_0_92,axiom,
( food(X1,X2)
| ~ meat(X1,X2) ),
clause20,
[final] ).
cnf(c_0_93,axiom,
( meat(X1,X2)
| ~ burger(X1,X2) ),
clause19,
[final] ).
cnf(c_0_94,axiom,
( male(X1,X2)
| ~ man(X1,X2) ),
clause14,
[final] ).
cnf(c_0_95,axiom,
( animate(X1,X2)
| ~ human_person(X1,X2) ),
clause13,
[final] ).
cnf(c_0_96,axiom,
( human(X1,X2)
| ~ human_person(X1,X2) ),
clause12,
[final] ).
cnf(c_0_97,axiom,
( living(X1,X2)
| ~ organism(X1,X2) ),
clause11,
[final] ).
cnf(c_0_98,axiom,
( impartial(X1,X2)
| ~ object(X1,X2) ),
clause25,
[final] ).
cnf(c_0_99,axiom,
( impartial(X1,X2)
| ~ organism(X1,X2) ),
clause10,
[final] ).
cnf(c_0_100,axiom,
( existent(X1,X2)
| ~ entity(X1,X2) ),
clause9,
[final] ).
cnf(c_0_101,axiom,
( specific(X1,X2)
| ~ eventuality(X1,X2) ),
clause30,
[final] ).
cnf(c_0_102,axiom,
( specific(X1,X2)
| ~ entity(X1,X2) ),
clause8,
[final] ).
cnf(c_0_103,axiom,
( singleton(X1,X2)
| ~ thing(X1,X2) ),
clause7,
[final] ).
cnf(c_0_104,axiom,
( thing(X1,X2)
| ~ eventuality(X1,X2) ),
clause29,
[final] ).
cnf(c_0_105,axiom,
( thing(X1,X2)
| ~ entity(X1,X2) ),
clause6,
[final] ).
cnf(c_0_106,axiom,
( skf16(X1,X2) != skf14(X1,X2)
| ~ three(X2,X1) ),
clause47,
[final] ).
cnf(c_0_107,axiom,
( skf18(X1,X2) != skf14(X1,X2)
| ~ three(X2,X1) ),
clause45,
[final] ).
cnf(c_0_108,axiom,
( entity(X1,X2)
| ~ object(X1,X2) ),
clause23,
[final] ).
cnf(c_0_109,axiom,
( organism(X1,X2)
| ~ human_person(X1,X2) ),
clause4,
[final] ).
cnf(c_0_110,axiom,
( skf18(X1,X2) != skf16(X1,X2)
| ~ three(X2,X1) ),
clause46,
[final] ).
cnf(c_0_111,axiom,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
clause35,
[final] ).
cnf(c_0_112,negated_conjecture,
( young(skc2,X1)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X3,skc3) ),
clause60,
[final] ).
cnf(c_0_113,negated_conjecture,
( guy(skc2,X1)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X3,skc3) ),
clause59,
[final] ).
cnf(c_0_114,axiom,
( furniture(X1,X2)
| ~ table(X1,X2) ),
clause33,
[final] ).
cnf(c_0_115,axiom,
( object(X1,X2)
| ~ artifact(X1,X2) ),
clause36,
[final] ).
cnf(c_0_116,axiom,
( object(X1,X2)
| ~ substance_matter(X1,X2) ),
clause22,
[final] ).
cnf(c_0_117,axiom,
( entity(X1,X2)
| ~ organism(X1,X2) ),
clause5,
[final] ).
cnf(c_0_118,axiom,
( eventuality(X1,X2)
| ~ event(X1,X2) ),
clause28,
[final] ).
cnf(c_0_119,axiom,
( human_person(X1,X2)
| ~ man(X1,X2) ),
clause3,
[final] ).
cnf(c_0_120,axiom,
( burger(X1,X2)
| ~ hamburger(X1,X2) ),
clause18,
[final] ).
cnf(c_0_121,axiom,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
clause37,
[final] ).
cnf(c_0_122,negated_conjecture,
( table(skc2,skf11(X2))
| ~ member(skc2,X1,skc3) ),
clause58,
[final] ).
cnf(c_0_123,negated_conjecture,
( three(skc2,skf9(X2))
| ~ member(skc2,X1,skc3) ),
clause56,
[final] ).
cnf(c_0_124,axiom,
( event(X1,X2)
| ~ sit(X1,X2) ),
clause27,
[final] ).
cnf(c_0_125,axiom,
( ~ nonliving(X1,X2)
| ~ animate(X1,X2) ),
clause41,
[final] ).
cnf(c_0_126,axiom,
( ~ living(X1,X2)
| ~ nonliving(X1,X2) ),
clause39,
[final] ).
cnf(c_0_127,axiom,
( ~ nonexistent(X1,X2)
| ~ existent(X1,X2) ),
clause40,
[final] ).
cnf(c_0_128,axiom,
( group(X1,X2)
| ~ three(X1,X2) ),
clause17,
[final] ).
cnf(c_0_129,axiom,
( man(X1,X2)
| ~ guy(X1,X2) ),
clause2,
[final] ).
cnf(c_0_130,negated_conjecture,
( group(skc2,skf9(X2))
| ~ member(skc2,X1,skc3) ),
clause57,
[final] ).
cnf(c_0_131,negated_conjecture,
( hamburger(skc2,X1)
| ~ member(skc2,X1,skc3) ),
clause55,
[final] ).
cnf(c_0_132,negated_conjecture,
~ singleton(skc2,skc3),
inference(spm,[status(thm)],[c_0_70,c_0_71]),
[final] ).
cnf(c_0_133,axiom,
~ member(X1,X2,X2),
clause1,
[final] ).
cnf(c_0_134,negated_conjecture,
actual_world(skc2),
clause53,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NLP040-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.14/0.32 % Computer : n031.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 2400
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon Oct 2 11:40:13 EDT 2023
% 0.14/0.32 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 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.Iv32sU5gyq/E---3.1_22809.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 22886 completed with status 1
% 0.18/0.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.47 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.18/0.47 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 22896 completed with status 1
% 0.18/0.47 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.47 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.18/0.47 # Preprocessing time : 0.002 s
% 0.18/0.47
% 0.18/0.47 # No proof found!
% 0.18/0.47 # SZS status Satisfiable
% 0.18/0.47 # SZS output start Saturation
% See solution above
% 0.18/0.47 # Parsed axioms : 66
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 66
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 66
% 0.18/0.47 # Processed clauses : 69
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 69
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 3
% 0.18/0.47 # ...of the previous two non-redundant : 3
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 3
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Total rewrite steps : 0
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 69
% 0.18/0.47 # Positive orientable unit clauses : 4
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 2
% 0.18/0.47 # Non-unit-clauses : 63
% 0.18/0.47 # Current number of unprocessed clauses: 0
% 0.18/0.47 # ...number of literals in the above : 0
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 0
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 1636
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 1053
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 16
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 0
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 1506
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.007 s
% 0.18/0.47 # System time : 0.001 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1712 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.032 s
% 0.18/0.47 # System time : 0.008 s
% 0.18/0.47 # Total time : 0.040 s
% 0.18/0.47 # Maximum resident set size: 1728 pages
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------