TSTP Solution File: NLP048-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP048-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:56 EDT 2023
% Result : Satisfiable 0.20s 0.48s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause42)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_46,negated_conjecture,
( patient(X1,skf6(X1,X2,X5),X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X3,X1) ),
clause41,
[final] ).
cnf(c_0_47,negated_conjecture,
( ssSkP0(X1,X2,X3)
| member(X3,skf8(X1,X3,X2),X2) ),
clause35,
[final] ).
cnf(c_0_48,negated_conjecture,
( event(X1,skf6(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X3,X1) ),
clause36,
[final] ).
cnf(c_0_49,negated_conjecture,
( nonreflexive(X1,skf6(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X3,X1) ),
clause38,
[final] ).
cnf(c_0_50,negated_conjecture,
( present(X1,skf6(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X3,X1) ),
clause37,
[final] ).
cnf(c_0_51,negated_conjecture,
( cost(X1,skf6(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X3,X1) ),
clause39,
[final] ).
cnf(c_0_52,negated_conjecture,
( ssSkP0(X1,X2,X3)
| patient(X3,skf6(X3,skf8(X1,X3,X2),X4),skf8(X1,X3,X2))
| ~ ssSkP0(X5,X2,X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]),
[final] ).
cnf(c_0_53,negated_conjecture,
( ssSkC0
| ssSkP0(skc34,skc34,skc33) ),
clause28,
[final] ).
cnf(c_0_54,negated_conjecture,
( ssSkP0(X1,X2,X3)
| event(X3,skf6(X3,X4,X5))
| ~ ssSkP0(X6,X2,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_47]),
[final] ).
cnf(c_0_55,negated_conjecture,
( ssSkP0(X1,X2,X3)
| nonreflexive(X3,skf6(X3,X4,X5))
| ~ ssSkP0(X6,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]),
[final] ).
cnf(c_0_56,negated_conjecture,
( present(X1,skf6(X1,X2,X3))
| ssSkP0(X4,X5,X1)
| ~ ssSkP0(X6,X5,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_47]),
[final] ).
cnf(c_0_57,negated_conjecture,
( cost(X1,skf6(X1,X2,X3))
| ssSkP0(X4,X5,X1)
| ~ ssSkP0(X6,X5,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_47]),
[final] ).
cnf(c_0_58,negated_conjecture,
( agent(X1,skf6(X1,X2,X4),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X3,X1) ),
clause40,
[final] ).
cnf(c_0_59,negated_conjecture,
( ssSkP0(X3,X5,X1)
| ~ cost(X1,X2)
| ~ nonreflexive(X1,X2)
| ~ present(X1,X2)
| ~ patient(X1,X2,skf8(X3,X1,X4))
| ~ agent(X1,X2,X3)
| ~ event(X1,X2) ),
clause42,
[final] ).
cnf(c_0_60,negated_conjecture,
( ssSkP0(X1,skc34,skc33)
| patient(skc33,skf6(skc33,skf8(X1,skc33,skc34),X2),skf8(X1,skc33,skc34))
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]),
[final] ).
cnf(c_0_61,negated_conjecture,
( ssSkP0(X1,skc34,skc33)
| event(skc33,skf6(skc33,X2,X3))
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_54,c_0_53]),
[final] ).
cnf(c_0_62,negated_conjecture,
( ssSkP0(X1,skc34,skc33)
| nonreflexive(skc33,skf6(skc33,X2,X3))
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_55,c_0_53]),
[final] ).
cnf(c_0_63,negated_conjecture,
( present(skc33,skf6(skc33,X1,X2))
| ssSkP0(X3,skc34,skc33)
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_56,c_0_53]),
[final] ).
cnf(c_0_64,negated_conjecture,
( cost(skc33,skf6(skc33,X1,X2))
| ssSkP0(X3,skc34,skc33)
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_57,c_0_53]),
[final] ).
cnf(c_0_65,negated_conjecture,
( ssSkP0(X1,X2,X3)
| agent(X3,skf6(X3,skf8(X1,X3,X2),X4),X4)
| ~ ssSkP0(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_58,c_0_47]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ssSkC0
| member(X1,skf10(X1,X2),X2)
| ~ group(X1,X2)
| ~ five(X1,X2)
| ~ nonhuman(X1,X3)
| ~ mia_forename(X1,X3)
| ~ forename(X1,X3)
| ~ ssSkP0(X3,X2,X1)
| ~ agent(X1,X4,X5)
| ~ woman(X1,X5)
| ~ of(X1,X3,X5)
| ~ event(X1,X4)
| ~ past(X1,X4)
| ~ nonreflexive(X1,X4)
| ~ order(X1,X4)
| ~ patient(X1,X4,X6)
| ~ shake_beverage(X1,X6)
| ~ actual_world(X1) ),
clause43,
[final] ).
cnf(c_0_67,negated_conjecture,
actual_world(skc33),
clause1,
[final] ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| group(skc33,skc34) ),
clause11,
[final] ).
cnf(c_0_69,negated_conjecture,
( ssSkC0
| five(skc33,skc34) ),
clause12,
[final] ).
cnf(c_0_70,negated_conjecture,
( ssSkC0
| nonhuman(skc33,skc34) ),
clause13,
[final] ).
cnf(c_0_71,negated_conjecture,
( ssSkC0
| dollar(skc33,X1)
| ~ member(skc33,X1,skc34) ),
clause33,
[final] ).
cnf(c_0_72,negated_conjecture,
( ssSkP0(X1,skc34,skc33)
| ssSkP0(X1,X2,skc33)
| ssSkC0
| ~ agent(skc33,skf6(skc33,skf8(X1,skc33,skc34),X3),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_63]),c_0_64]),
[final] ).
cnf(c_0_73,negated_conjecture,
( ssSkP0(X1,skc34,skc33)
| agent(skc33,skf6(skc33,skf8(X1,skc33,skc34),skc34),skc34)
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_65,c_0_53]),
[final] ).
cnf(c_0_74,negated_conjecture,
( member(skc33,skf10(skc33,skc34),skc34)
| ssSkC0
| ~ patient(skc33,X1,X2)
| ~ of(skc33,skc34,X3)
| ~ agent(skc33,X1,X3)
| ~ shake_beverage(skc33,X2)
| ~ order(skc33,X1)
| ~ nonreflexive(skc33,X1)
| ~ past(skc33,X1)
| ~ event(skc33,X1)
| ~ woman(skc33,X3)
| ~ forename(skc33,skc34)
| ~ mia_forename(skc33,skc34) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_53]),c_0_67])]),c_0_68]),c_0_69]),c_0_70]),
[final] ).
cnf(c_0_75,negated_conjecture,
( dollar(skc33,skf8(X1,skc33,skc34))
| ssSkP0(X1,skc34,skc33)
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_71,c_0_47]),
[final] ).
cnf(c_0_76,negated_conjecture,
( member(X1,skf5(X1,X6),X6)
| ~ mia_forename(X1,X2)
| ~ forename(X1,X2)
| ~ agent(X1,X3,X4)
| ~ woman(X1,X4)
| ~ of(X1,X2,X4)
| ~ event(X1,X3)
| ~ past(X1,X3)
| ~ nonreflexive(X1,X3)
| ~ order(X1,X3)
| ~ patient(X1,X3,X5)
| ~ shake_beverage(X1,X5)
| ~ group(X1,X6)
| ~ five(X1,X6)
| ~ ssSkP0(X6,X6,X1)
| ~ nonhuman(X1,X6)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause46,
[final] ).
cnf(c_0_77,negated_conjecture,
( ssSkC0
| ~ dollar(X1,skf10(X1,X2))
| ~ group(X1,X3)
| ~ five(X1,X3)
| ~ nonhuman(X1,X4)
| ~ mia_forename(X1,X4)
| ~ forename(X1,X4)
| ~ ssSkP0(X4,X3,X1)
| ~ agent(X1,X5,X6)
| ~ woman(X1,X6)
| ~ of(X1,X4,X6)
| ~ event(X1,X5)
| ~ past(X1,X5)
| ~ nonreflexive(X1,X5)
| ~ order(X1,X5)
| ~ patient(X1,X5,X7)
| ~ shake_beverage(X1,X7)
| ~ actual_world(X1) ),
clause44,
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ mia_forename(X1,X2)
| ~ forename(X1,X2)
| ~ agent(X1,X3,X4)
| ~ woman(X1,X4)
| ~ of(X1,X2,X4)
| ~ event(X1,X3)
| ~ past(X1,X3)
| ~ nonreflexive(X1,X3)
| ~ order(X1,X3)
| ~ patient(X1,X3,X5)
| ~ shake_beverage(X1,X5)
| ~ dollar(X1,skf5(X1,X6))
| ~ group(X1,X7)
| ~ five(X1,X7)
| ~ ssSkP0(X7,X7,X1)
| ~ nonhuman(X1,X7)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause45,
[final] ).
cnf(c_0_79,negated_conjecture,
( dollar(skc12,X1)
| ~ member(skc12,X1,skc13)
| ~ ssSkC0 ),
clause34,
[final] ).
cnf(c_0_80,negated_conjecture,
( ssSkC0
| patient(skc33,skc35,skc36) ),
clause27,
[final] ).
cnf(c_0_81,negated_conjecture,
( ssSkC0
| of(skc33,skc37,skc38) ),
clause26,
[final] ).
cnf(c_0_82,negated_conjecture,
( ssSkC0
| agent(skc33,skc35,skc38) ),
clause25,
[final] ).
cnf(c_0_83,negated_conjecture,
( ssSkP0(skc16,skc13,skc12)
| ~ ssSkC0 ),
clause29,
[final] ).
cnf(c_0_84,negated_conjecture,
( patient(skc12,skc14,skc15)
| ~ ssSkC0 ),
clause32,
[final] ).
cnf(c_0_85,negated_conjecture,
( of(skc12,skc16,skc17)
| ~ ssSkC0 ),
clause31,
[final] ).
cnf(c_0_86,negated_conjecture,
( agent(skc12,skc14,skc17)
| ~ ssSkC0 ),
clause30,
[final] ).
cnf(c_0_87,negated_conjecture,
( ssSkC0
| shake_beverage(skc33,skc36) ),
clause10,
[final] ).
cnf(c_0_88,negated_conjecture,
( ssSkC0
| order(skc33,skc35) ),
clause9,
[final] ).
cnf(c_0_89,negated_conjecture,
( ssSkC0
| nonreflexive(skc33,skc35) ),
clause8,
[final] ).
cnf(c_0_90,negated_conjecture,
( ssSkC0
| past(skc33,skc35) ),
clause7,
[final] ).
cnf(c_0_91,negated_conjecture,
( ssSkC0
| event(skc33,skc35) ),
clause6,
[final] ).
cnf(c_0_92,negated_conjecture,
( ssSkC0
| woman(skc33,skc38) ),
clause5,
[final] ).
cnf(c_0_93,negated_conjecture,
( ssSkC0
| forename(skc33,skc37) ),
clause4,
[final] ).
cnf(c_0_94,negated_conjecture,
( nonhuman(skc12,skc16)
| ~ ssSkC0 ),
clause16,
[final] ).
cnf(c_0_95,negated_conjecture,
( five(skc12,skc13)
| ~ ssSkC0 ),
clause15,
[final] ).
cnf(c_0_96,negated_conjecture,
( group(skc12,skc13)
| ~ ssSkC0 ),
clause14,
[final] ).
cnf(c_0_97,negated_conjecture,
( shake_beverage(skc12,skc15)
| ~ ssSkC0 ),
clause24,
[final] ).
cnf(c_0_98,negated_conjecture,
( ssSkC0
| mia_forename(skc33,skc37) ),
clause3,
[final] ).
cnf(c_0_99,negated_conjecture,
( order(skc12,skc14)
| ~ ssSkC0 ),
clause23,
[final] ).
cnf(c_0_100,negated_conjecture,
( nonreflexive(skc12,skc14)
| ~ ssSkC0 ),
clause22,
[final] ).
cnf(c_0_101,negated_conjecture,
( past(skc12,skc14)
| ~ ssSkC0 ),
clause21,
[final] ).
cnf(c_0_102,negated_conjecture,
( event(skc12,skc14)
| ~ ssSkC0 ),
clause20,
[final] ).
cnf(c_0_103,negated_conjecture,
( woman(skc12,skc17)
| ~ ssSkC0 ),
clause19,
[final] ).
cnf(c_0_104,negated_conjecture,
( forename(skc12,skc16)
| ~ ssSkC0 ),
clause18,
[final] ).
cnf(c_0_105,negated_conjecture,
( mia_forename(skc12,skc16)
| ~ ssSkC0 ),
clause17,
[final] ).
cnf(c_0_106,negated_conjecture,
actual_world(skc12),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP048-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.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:13:12 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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.EI8LdTMDxg/E---3.1_9133.p
% 0.20/0.48 # Version: 3.1pre001
% 0.20/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 9213 completed with status 1
% 0.20/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 811s (1) cores
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting sh5l with 136s (1) cores
% 0.20/0.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 9217 completed with status 1
% 0.20/0.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.20/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 811s (1) cores
% 0.20/0.48 # Preprocessing time : 0.002 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # No proof found!
% 0.20/0.48 # SZS status Satisfiable
% 0.20/0.48 # SZS output start Saturation
% See solution above
% 0.20/0.48 # Parsed axioms : 46
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 46
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 46
% 0.20/0.48 # Processed clauses : 108
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 1
% 0.20/0.48 # ...remaining for further processing : 107
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 16
% 0.20/0.48 # ...of the previous two non-redundant : 16
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 7
% 0.20/0.48 # Paramodulations : 16
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Total rewrite steps : 1
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 61
% 0.20/0.48 # Positive orientable unit clauses : 2
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 59
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 46
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 1704
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 581
% 0.20/0.48 # Non-unit clause-clause subsumptions : 8
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2288
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.011 s
% 0.20/0.48 # Maximum resident set size: 1712 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.041 s
% 0.20/0.48 # System time : 0.012 s
% 0.20/0.48 # Total time : 0.052 s
% 0.20/0.48 # Maximum resident set size: 1732 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------