TSTP Solution File: NLP222-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP222-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_51,negated_conjecture,
actual_world(skc29),
clause1,
[final] ).
cnf(c_0_90,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_56]),c_0_57]),c_0_55]),
[final] ).
cnf(c_0_111,negated_conjecture,
( agent(skc22,skf5(X1),X1)
| ~ man(skc22,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_90])]),
[final] ).
cnf(c_0_112,negated_conjecture,
( present(skc22,skf5(X1))
| ~ man(skc22,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_90])]),
[final] ).
cnf(c_0_113,negated_conjecture,
( event(skc22,skf5(X1))
| ~ man(skc22,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_90])]),
[final] ).
cnf(c_0_114,negated_conjecture,
( smoke(skc22,skf5(X1))
| ~ man(skc22,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_90])]),
[final] ).
cnf(c_0_115,negated_conjecture,
( man(X1,skf7(X1))
| ~ be(X2,X3,X4,X4)
| ~ of(X2,X5,X4)
| ~ of(X2,X6,X7)
| ~ agent(X2,X8,X7)
| ~ theme(X2,X8,X1)
| ~ jules_forename(X2,X5)
| ~ state(X2,X3)
| ~ man(X2,X4)
| ~ man(X2,X7)
| ~ forename(X2,X5)
| ~ forename(X2,X6)
| ~ vincent_forename(X2,X6)
| ~ event(X2,X8)
| ~ present(X2,X8)
| ~ think_believe_consider(X2,X8)
| ~ accessible_world(X2,X1)
| ~ proposition(X2,X1)
| ~ actual_world(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]),
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ smoke(X1,X2)
| ~ be(X3,X4,X5,X5)
| ~ of(X3,X6,X5)
| ~ of(X3,X7,X8)
| ~ agent(X1,X2,skf7(X1))
| ~ agent(X3,X9,X8)
| ~ theme(X3,X9,X1)
| ~ jules_forename(X3,X6)
| ~ state(X3,X4)
| ~ man(X3,X5)
| ~ man(X3,X8)
| ~ forename(X3,X6)
| ~ forename(X3,X7)
| ~ vincent_forename(X3,X7)
| ~ event(X1,X2)
| ~ event(X3,X9)
| ~ present(X1,X2)
| ~ present(X3,X9)
| ~ think_believe_consider(X3,X9)
| ~ accessible_world(X3,X1)
| ~ proposition(X3,X1)
| ~ actual_world(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_90])]),
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ smoke(skc22,skf5(skf7(skc22)))
| ~ be(X1,X2,X3,X3)
| ~ of(X1,X4,X3)
| ~ of(X1,X5,X6)
| ~ agent(X1,X7,X6)
| ~ theme(X1,X7,skc22)
| ~ 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,skc22)
| ~ proposition(X1,skc22)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_90])]),
[final] ).
cnf(c_0_118,negated_conjecture,
be(skc17,skc18,skc21,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_90])]),
[final] ).
cnf(c_0_119,negated_conjecture,
theme(skc17,skc23,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_90])]),
[final] ).
cnf(c_0_120,negated_conjecture,
agent(skc17,skc23,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_90])]),
[final] ).
cnf(c_0_121,negated_conjecture,
of(skc17,skc24,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_90])]),
[final] ).
cnf(c_0_122,negated_conjecture,
of(skc17,skc20,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_90])]),
[final] ).
cnf(c_0_123,negated_conjecture,
proposition(skc17,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_90])]),
[final] ).
cnf(c_0_124,negated_conjecture,
accessible_world(skc17,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_90])]),
[final] ).
cnf(c_0_125,negated_conjecture,
think_believe_consider(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_90])]),
[final] ).
cnf(c_0_126,negated_conjecture,
present(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_90])]),
[final] ).
cnf(c_0_127,negated_conjecture,
event(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_90])]),
[final] ).
cnf(c_0_128,negated_conjecture,
vincent_forename(skc17,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_90])]),
[final] ).
cnf(c_0_129,negated_conjecture,
forename(skc17,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_90])]),
[final] ).
cnf(c_0_130,negated_conjecture,
forename(skc17,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_90])]),
[final] ).
cnf(c_0_131,negated_conjecture,
man(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_90])]),
[final] ).
cnf(c_0_132,negated_conjecture,
man(skc17,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_90])]),
[final] ).
cnf(c_0_133,negated_conjecture,
man(skc17,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_90])]),
[final] ).
cnf(c_0_134,negated_conjecture,
state(skc17,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_90])]),
[final] ).
cnf(c_0_135,negated_conjecture,
jules_forename(skc17,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_90])]),
[final] ).
cnf(c_0_136,negated_conjecture,
actual_world(skc17),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP222-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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:34:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Rt4PJzUu03/E---3.1_3495.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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 # new_bool_3 with pid 3573 completed with status 1
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNF-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 3578 completed with status 1
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNF-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 : 147
% 0.20/0.51 # ...of these trivial : 3
% 0.20/0.51 # ...subsumed : 1
% 0.20/0.51 # ...remaining for further processing : 143
% 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 : 10
% 0.20/0.51 # Backward-rewritten : 56
% 0.20/0.51 # Generated clauses : 26
% 0.20/0.51 # ...of the previous two non-redundant : 49
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 41
% 0.20/0.51 # Paramodulations : 26
% 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 : 61
% 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 : 28
% 0.20/0.51 # Positive orientable unit clauses : 21
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 7
% 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 : 115
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 2011
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 641
% 0.20/0.51 # Non-unit clause-clause subsumptions : 52
% 0.20/0.51 # Unit Clause-clause subsumption calls : 1
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3769
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.015 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.018 s
% 0.20/0.51 # Maximum resident set size: 1808 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.018 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.023 s
% 0.20/0.51 # Maximum resident set size: 1732 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------