TSTP Solution File: NLP223-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP223-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:45:15 EDT 2023
% Result : Satisfiable 0.20s 0.49s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause45)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_48,negated_conjecture,
( ssSkC0
| man(X4,skf13(X4))
| ~ state(X1,X2)
| ~ man(X1,X3)
| ~ accessible_world(X1,X4)
| ~ proposition(X1,X4)
| ~ theme(X1,X5,X4)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ think_believe_consider(X1,X5)
| ~ forename(X1,X6)
| ~ vincent_forename(X1,X6)
| ~ of(X1,X6,X7)
| ~ man(X1,X7)
| ~ agent(X1,X5,X7)
| ~ be(X1,X2,X7,X3)
| ~ forename(X1,X8)
| ~ jules_forename(X1,X8)
| ~ of(X1,X8,X7)
| ~ actual_world(X1) ),
clause45,
[final] ).
cnf(c_0_49,negated_conjecture,
( ssSkC0
| be(skc27,skc28,skc29,skc29) ),
clause35,
[final] ).
cnf(c_0_50,negated_conjecture,
actual_world(skc27),
clause1,
[final] ).
cnf(c_0_51,negated_conjecture,
( ssSkC0
| man(skc27,skc29) ),
clause12,
[final] ).
cnf(c_0_52,negated_conjecture,
( ssSkC0
| state(skc27,skc28) ),
clause11,
[final] ).
cnf(c_0_53,negated_conjecture,
( man(X1,skf13(X1))
| ssSkC0
| ~ of(skc27,X2,skc29)
| ~ of(skc27,X3,skc29)
| ~ agent(skc27,X4,skc29)
| ~ theme(skc27,X4,X1)
| ~ jules_forename(skc27,X2)
| ~ forename(skc27,X2)
| ~ forename(skc27,X3)
| ~ vincent_forename(skc27,X3)
| ~ event(skc27,X4)
| ~ present(skc27,X4)
| ~ think_believe_consider(skc27,X4)
| ~ accessible_world(skc27,X1)
| ~ proposition(skc27,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),c_0_51]),c_0_52]),
[final] ).
cnf(c_0_54,negated_conjecture,
( ssSkC0
| theme(skc27,skc32,skc31) ),
clause27,
[final] ).
cnf(c_0_55,negated_conjecture,
( ssSkC0
| proposition(skc27,skc31) ),
clause3,
[final] ).
cnf(c_0_56,negated_conjecture,
( ssSkC0
| accessible_world(skc27,skc31) ),
clause4,
[final] ).
cnf(c_0_57,negated_conjecture,
( ssSkC0
| think_believe_consider(skc27,skc32) ),
clause5,
[final] ).
cnf(c_0_58,negated_conjecture,
( ssSkC0
| present(skc27,skc32) ),
clause6,
[final] ).
cnf(c_0_59,negated_conjecture,
( ssSkC0
| event(skc27,skc32) ),
clause7,
[final] ).
cnf(c_0_61,negated_conjecture,
( ssSkC0
| jules_forename(skc27,skc30) ),
clause14,
[final] ).
cnf(c_0_62,negated_conjecture,
( ssSkC0
| forename(skc27,skc30) ),
clause13,
[final] ).
cnf(c_0_63,negated_conjecture,
( ssSkC0
| of(skc27,skc30,skc29) ),
clause30,
[final] ).
cnf(c_0_64,negated_conjecture,
( man(skc31,skf13(skc31))
| ssSkC0
| ~ of(skc27,X1,skc29)
| ~ agent(skc27,skc32,skc29)
| ~ forename(skc27,X1)
| ~ vincent_forename(skc27,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63]),
[final] ).
cnf(c_0_65,negated_conjecture,
( ssSkC0
| vincent_forename(skc27,skc33) ),
clause8,
[final] ).
cnf(c_0_66,negated_conjecture,
( ssSkC0
| forename(skc27,skc33) ),
clause9,
[final] ).
cnf(c_0_67,negated_conjecture,
( ssSkC0
| ~ state(X1,X2)
| ~ man(X1,X3)
| ~ smoke(X4,X5)
| ~ present(X4,X5)
| ~ agent(X4,X5,skf13(X4))
| ~ event(X4,X5)
| ~ accessible_world(X1,X4)
| ~ proposition(X1,X4)
| ~ theme(X1,X6,X4)
| ~ event(X1,X6)
| ~ present(X1,X6)
| ~ think_believe_consider(X1,X6)
| ~ forename(X1,X7)
| ~ vincent_forename(X1,X7)
| ~ of(X1,X7,X8)
| ~ man(X1,X8)
| ~ agent(X1,X6,X8)
| ~ be(X1,X2,X8,X3)
| ~ forename(X1,X9)
| ~ jules_forename(X1,X9)
| ~ of(X1,X9,X8)
| ~ actual_world(X1) ),
clause47,
[final] ).
cnf(c_0_68,negated_conjecture,
( ssSkC0
| agent(skc31,skf11(X1),X1)
| ~ man(skc31,X1) ),
clause43,
[final] ).
cnf(c_0_69,negated_conjecture,
( ssSkC0
| present(skc31,skf11(X2))
| ~ man(skc31,X1) ),
clause38,
[final] ).
cnf(c_0_70,negated_conjecture,
( ssSkC0
| event(skc31,skf11(X2))
| ~ man(skc31,X1) ),
clause37,
[final] ).
cnf(c_0_71,negated_conjecture,
( ssSkC0
| smoke(skc31,skf11(X2))
| ~ man(skc31,X1) ),
clause39,
[final] ).
cnf(c_0_73,negated_conjecture,
( ssSkC0
| ~ smoke(skc31,skf11(skf13(skc31)))
| ~ be(X1,X2,X3,X4)
| ~ of(X1,X5,X3)
| ~ of(X1,X6,X3)
| ~ agent(X1,X7,X3)
| ~ theme(X1,X7,skc31)
| ~ jules_forename(X1,X5)
| ~ state(X1,X2)
| ~ man(X1,X3)
| ~ man(X1,X4)
| ~ forename(X1,X5)
| ~ forename(X1,X6)
| ~ vincent_forename(X1,X6)
| ~ event(X1,X7)
| ~ present(X1,X7)
| ~ think_believe_consider(X1,X7)
| ~ accessible_world(X1,skc31)
| ~ proposition(X1,skc31)
| ~ actual_world(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_48]),
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ proposition(X1,X2)
| ~ accessible_world(X1,X2)
| ~ smoke(X2,X3)
| ~ present(X2,X3)
| ~ agent(X2,X3,skf9(X2))
| ~ event(X2,X3)
| ~ think_believe_consider(X1,X4)
| ~ present(X1,X4)
| ~ event(X1,X4)
| ~ theme(X1,X4,X2)
| ~ vincent_forename(X1,X5)
| ~ forename(X1,X5)
| ~ agent(X1,X4,X6)
| ~ man(X1,X6)
| ~ of(X1,X5,X6)
| ~ state(X1,X7)
| ~ man(X1,X8)
| ~ be(X1,X7,X8,X8)
| ~ forename(X1,X9)
| ~ jules_forename(X1,X9)
| ~ of(X1,X9,X8)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause48,
[final] ).
cnf(c_0_80,negated_conjecture,
( agent(skc19,skf7(X1),X1)
| ~ man(skc19,X1)
| ~ ssSkC0 ),
clause44,
[final] ).
cnf(c_0_81,negated_conjecture,
( present(skc19,skf7(X2))
| ~ man(skc19,X1)
| ~ ssSkC0 ),
clause41,
[final] ).
cnf(c_0_82,negated_conjecture,
( event(skc19,skf7(X2))
| ~ man(skc19,X1)
| ~ ssSkC0 ),
clause40,
[final] ).
cnf(c_0_83,negated_conjecture,
( man(X2,skf9(X2))
| ~ proposition(X1,X2)
| ~ accessible_world(X1,X2)
| ~ think_believe_consider(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ theme(X1,X3,X2)
| ~ vincent_forename(X1,X4)
| ~ forename(X1,X4)
| ~ agent(X1,X3,X5)
| ~ man(X1,X5)
| ~ of(X1,X4,X5)
| ~ state(X1,X6)
| ~ man(X1,X7)
| ~ be(X1,X6,X7,X7)
| ~ forename(X1,X8)
| ~ jules_forename(X1,X8)
| ~ of(X1,X8,X7)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause46,
[final] ).
cnf(c_0_84,negated_conjecture,
( ssSkC0
| ~ of(skc27,skc33,skc29)
| ~ agent(skc27,skc32,skc29) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_65]),c_0_66]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ~ smoke(skc19,skf7(skf9(skc19)))
| ~ be(X1,X2,X3,X3)
| ~ of(X1,X4,X3)
| ~ of(X1,X5,X6)
| ~ agent(X1,X7,X6)
| ~ theme(X1,X7,skc19)
| ~ jules_forename(X1,X4)
| ~ state(X1,X2)
| ~ man(X1,X3)
| ~ man(X1,X6)
| ~ forename(X1,X4)
| ~ forename(X1,X5)
| ~ vincent_forename(X1,X5)
| ~ event(X1,X7)
| ~ present(X1,X7)
| ~ think_believe_consider(X1,X7)
| ~ accessible_world(X1,skc19)
| ~ proposition(X1,skc19)
| ~ ssSkC0
| ~ actual_world(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]),c_0_83]),
[final] ).
cnf(c_0_86,negated_conjecture,
( smoke(skc19,skf7(X2))
| ~ man(skc19,X1)
| ~ ssSkC0 ),
clause42,
[final] ).
cnf(c_0_87,negated_conjecture,
( be(skc16,skc17,skc22,skc18)
| ~ ssSkC0 ),
clause36,
[final] ).
cnf(c_0_88,negated_conjecture,
( ssSkC0
| of(skc27,skc33,skc34) ),
clause29,
[final] ).
cnf(c_0_89,negated_conjecture,
( ssSkC0
| agent(skc27,skc32,skc34) ),
clause28,
[final] ).
cnf(c_0_90,negated_conjecture,
( of(skc16,skc23,skc22)
| ~ ssSkC0 ),
clause34,
[final] ).
cnf(c_0_91,negated_conjecture,
( of(skc16,skc21,skc22)
| ~ ssSkC0 ),
clause32,
[final] ).
cnf(c_0_92,negated_conjecture,
( agent(skc16,skc20,skc22)
| ~ ssSkC0 ),
clause33,
[final] ).
cnf(c_0_93,negated_conjecture,
( theme(skc16,skc20,skc19)
| ~ ssSkC0 ),
clause31,
[final] ).
cnf(c_0_94,negated_conjecture,
( ssSkC0
| man(skc27,skc34) ),
clause10,
[final] ).
cnf(c_0_95,negated_conjecture,
( jules_forename(skc16,skc23)
| ~ ssSkC0 ),
clause26,
[final] ).
cnf(c_0_96,negated_conjecture,
( state(skc16,skc17)
| ~ ssSkC0 ),
clause15,
[final] ).
cnf(c_0_97,negated_conjecture,
( man(skc16,skc22)
| ~ ssSkC0 ),
clause24,
[final] ).
cnf(c_0_98,negated_conjecture,
( man(skc16,skc18)
| ~ ssSkC0 ),
clause16,
[final] ).
cnf(c_0_99,negated_conjecture,
( forename(skc16,skc23)
| ~ ssSkC0 ),
clause25,
[final] ).
cnf(c_0_100,negated_conjecture,
( forename(skc16,skc21)
| ~ ssSkC0 ),
clause22,
[final] ).
cnf(c_0_101,negated_conjecture,
( vincent_forename(skc16,skc21)
| ~ ssSkC0 ),
clause23,
[final] ).
cnf(c_0_102,negated_conjecture,
( event(skc16,skc20)
| ~ ssSkC0 ),
clause19,
[final] ).
cnf(c_0_103,negated_conjecture,
( present(skc16,skc20)
| ~ ssSkC0 ),
clause20,
[final] ).
cnf(c_0_104,negated_conjecture,
( think_believe_consider(skc16,skc20)
| ~ ssSkC0 ),
clause21,
[final] ).
cnf(c_0_105,negated_conjecture,
( accessible_world(skc16,skc19)
| ~ ssSkC0 ),
clause17,
[final] ).
cnf(c_0_106,negated_conjecture,
( proposition(skc16,skc19)
| ~ ssSkC0 ),
clause18,
[final] ).
cnf(c_0_107,negated_conjecture,
actual_world(skc16),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP223-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 11:10:20 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.nfBuYgGJe8/E---3.1_13622.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_1 with pid 13701 completed with status 1
% 0.20/0.49 # Result found by new_bool_1
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 13707 completed with status 1
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.002 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # No proof found!
% 0.20/0.49 # SZS status Satisfiable
% 0.20/0.49 # SZS output start Saturation
% See solution above
% 0.20/0.49 # Parsed axioms : 48
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 48
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 48
% 0.20/0.49 # Processed clauses : 112
% 0.20/0.49 # ...of these trivial : 2
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 110
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 9
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 19
% 0.20/0.49 # ...of the previous two non-redundant : 17
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 26
% 0.20/0.49 # Paramodulations : 19
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 53
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 51
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 57
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 1482
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 332
% 0.20/0.49 # Non-unit clause-clause subsumptions : 35
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3296
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.012 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 1816 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.015 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.017 s
% 0.20/0.49 # Maximum resident set size: 1736 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------