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 : 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:45:15 EDT 2023
% Result : CounterSatisfiable 0.18s 0.48s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_4)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_6,plain,
( man(X1,esk20_8(X2,X3,X4,X5,X6,X1,X7,X8))
| epred1_0
| ~ of(X2,X3,X4)
| ~ jules_forename(X2,X3)
| ~ forename(X2,X3)
| ~ of(X2,X5,X4)
| ~ man(X2,X4)
| ~ vincent_forename(X2,X5)
| ~ forename(X2,X5)
| ~ proposition(X2,X1)
| ~ agent(X2,X6,X4)
| ~ theme(X2,X6,X1)
| ~ event(X2,X6)
| ~ present(X2,X6)
| ~ think_believe_consider(X2,X6)
| ~ accessible_world(X2,X1)
| ~ man(X2,X7)
| ~ state(X2,X8)
| ~ be(X2,X8,X4,X7)
| ~ actual_world(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_7,plain,
( be(esk11_0,esk18_0,esk17_0,esk17_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_8,plain,
( actual_world(esk11_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_9,plain,
( man(esk11_0,esk17_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_10,plain,
( state(esk11_0,esk18_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_11,plain,
( epred1_0
| ~ event(X1,X2)
| ~ agent(X1,X2,esk20_8(X3,X4,X5,X6,X7,X1,X8,X9))
| ~ present(X1,X2)
| ~ smoke(X1,X2)
| ~ of(X3,X4,X5)
| ~ jules_forename(X3,X4)
| ~ forename(X3,X4)
| ~ of(X3,X6,X5)
| ~ man(X3,X5)
| ~ vincent_forename(X3,X6)
| ~ forename(X3,X6)
| ~ proposition(X3,X1)
| ~ agent(X3,X7,X5)
| ~ theme(X3,X7,X1)
| ~ event(X3,X7)
| ~ present(X3,X7)
| ~ think_believe_consider(X3,X7)
| ~ accessible_world(X3,X1)
| ~ man(X3,X8)
| ~ state(X3,X9)
| ~ be(X3,X9,X5,X8)
| ~ actual_world(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_14,plain,
( epred1_0
| man(X1,esk20_8(esk11_0,X2,esk17_0,X3,X4,X1,esk17_0,esk18_0))
| ~ jules_forename(esk11_0,X2)
| ~ accessible_world(esk11_0,X1)
| ~ think_believe_consider(esk11_0,X4)
| ~ present(esk11_0,X4)
| ~ event(esk11_0,X4)
| ~ theme(esk11_0,X4,X1)
| ~ agent(esk11_0,X4,esk17_0)
| ~ proposition(esk11_0,X1)
| ~ forename(esk11_0,X3)
| ~ forename(esk11_0,X2)
| ~ vincent_forename(esk11_0,X3)
| ~ of(esk11_0,X3,esk17_0)
| ~ of(esk11_0,X2,esk17_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10]),
[final] ).
cnf(c_0_15,plain,
( epred1_0
| ~ jules_forename(esk11_0,X1)
| ~ smoke(X2,X3)
| ~ accessible_world(esk11_0,X2)
| ~ think_believe_consider(esk11_0,X4)
| ~ present(esk11_0,X4)
| ~ present(X2,X3)
| ~ event(esk11_0,X4)
| ~ event(X2,X3)
| ~ theme(esk11_0,X4,X2)
| ~ agent(X2,X3,esk20_8(esk11_0,X1,esk17_0,X5,X4,X2,esk17_0,esk18_0))
| ~ agent(esk11_0,X4,esk17_0)
| ~ proposition(esk11_0,X2)
| ~ forename(esk11_0,X5)
| ~ forename(esk11_0,X1)
| ~ vincent_forename(esk11_0,X5)
| ~ of(esk11_0,X5,esk17_0)
| ~ of(esk11_0,X1,esk17_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_8]),c_0_9]),c_0_10]),
[final] ).
cnf(c_0_16,negated_conjecture,
( ~ epred1_0
| ~ actual_world(X3)
| ~ man(X3,X8)
| ~ man(X3,X4)
| ~ vincent_forename(X3,X5)
| ~ forename(X3,X7)
| ~ forename(X3,X5)
| ~ proposition(X3,X1)
| ~ event(X3,X6)
| ~ event(X1,X2)
| ~ present(X3,X6)
| ~ present(X1,X2)
| ~ think_believe_consider(X3,X6)
| ~ accessible_world(X3,X1)
| ~ smoke(X1,X2)
| ~ jules_forename(X3,X7)
| ~ state(X3,X9)
| ~ of(X3,X7,X8)
| ~ of(X3,X5,X4)
| ~ agent(X3,X6,X4)
| ~ theme(X3,X6,X1)
| ~ be(X3,X9,X8,X8)
| ~ agent(X1,X2,esk10_8(X3,X4,X5,X6,X1,X7,X8,X9)) ),
inference(cn,[status(thm)],[c_0_12]),
[final] ).
cnf(c_0_17,negated_conjecture,
( man(X1,esk10_8(X2,X3,X4,X5,X1,X6,X7,X8))
| ~ epred1_0
| ~ actual_world(X2)
| ~ man(X2,X7)
| ~ man(X2,X3)
| ~ vincent_forename(X2,X4)
| ~ forename(X2,X6)
| ~ forename(X2,X4)
| ~ proposition(X2,X1)
| ~ event(X2,X5)
| ~ present(X2,X5)
| ~ think_believe_consider(X2,X5)
| ~ accessible_world(X2,X1)
| ~ jules_forename(X2,X6)
| ~ state(X2,X8)
| ~ of(X2,X6,X7)
| ~ of(X2,X4,X3)
| ~ agent(X2,X5,X3)
| ~ theme(X2,X5,X1)
| ~ be(X2,X8,X7,X7) ),
inference(cn,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_18,plain,
( agent(esk15_0,esk19_1(X1),X1)
| epred1_0
| ~ man(esk15_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_19,plain,
( smoke(esk15_0,esk19_1(X1))
| epred1_0
| ~ man(esk15_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_20,plain,
( present(esk15_0,esk19_1(X1))
| epred1_0
| ~ man(esk15_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_21,negated_conjecture,
( agent(esk6_0,esk9_1(X1),X1)
| ~ man(esk6_0,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_22,plain,
( event(esk15_0,esk19_1(X1))
| epred1_0
| ~ man(esk15_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_23,plain,
( theme(esk11_0,esk14_0,esk15_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_24,plain,
( agent(esk11_0,esk14_0,esk12_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_25,plain,
( of(esk11_0,esk16_0,esk17_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_26,plain,
( of(esk11_0,esk13_0,esk12_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_27,plain,
( jules_forename(esk11_0,esk16_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_28,negated_conjecture,
( smoke(esk6_0,esk9_1(X1))
| ~ man(esk6_0,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_29,negated_conjecture,
( present(esk6_0,esk9_1(X1))
| ~ man(esk6_0,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_30,negated_conjecture,
( event(esk6_0,esk9_1(X1))
| ~ man(esk6_0,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_31,plain,
( accessible_world(esk11_0,esk15_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_32,plain,
( think_believe_consider(esk11_0,esk14_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_33,plain,
( present(esk11_0,esk14_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_34,plain,
( event(esk11_0,esk14_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_35,plain,
( proposition(esk11_0,esk15_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_36,plain,
( forename(esk11_0,esk16_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_37,plain,
( forename(esk11_0,esk13_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_38,negated_conjecture,
( be(esk1_0,esk8_0,esk3_0,esk7_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_39,negated_conjecture,
( theme(esk1_0,esk5_0,esk6_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_40,negated_conjecture,
( agent(esk1_0,esk5_0,esk3_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_41,negated_conjecture,
( of(esk1_0,esk4_0,esk3_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_42,negated_conjecture,
( of(esk1_0,esk2_0,esk3_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_43,plain,
( vincent_forename(esk11_0,esk13_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_44,plain,
( man(esk11_0,esk12_0)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
cnf(c_0_45,negated_conjecture,
( state(esk1_0,esk8_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_46,negated_conjecture,
( jules_forename(esk1_0,esk2_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_47,negated_conjecture,
( accessible_world(esk1_0,esk6_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_48,negated_conjecture,
( think_believe_consider(esk1_0,esk5_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_49,negated_conjecture,
( present(esk1_0,esk5_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_50,negated_conjecture,
( event(esk1_0,esk5_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_51,negated_conjecture,
( proposition(esk1_0,esk6_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_52,negated_conjecture,
( forename(esk1_0,esk4_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_53,negated_conjecture,
( forename(esk1_0,esk2_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_54,negated_conjecture,
( vincent_forename(esk1_0,esk4_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_55,negated_conjecture,
( man(esk1_0,esk7_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_56,negated_conjecture,
( man(esk1_0,esk3_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_57,negated_conjecture,
( actual_world(esk1_0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[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.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 11:37:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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.qWBArCwRKy/E---3.1_14665.p
% 0.18/0.48 # Version: 3.1pre001
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # new_bool_1 with pid 14744 completed with status 1
% 0.18/0.48 # Result found by new_bool_1
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.18/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 14746 completed with status 1
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.18/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # No proof found!
% 0.18/0.48 # SZS status CounterSatisfiable
% 0.18/0.48 # SZS output start Saturation
% See solution above
% 0.18/0.48 # Parsed axioms : 1
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 49
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 49
% 0.18/0.48 # Processed clauses : 101
% 0.18/0.48 # ...of these trivial : 2
% 0.18/0.48 # ...subsumed : 1
% 0.18/0.48 # ...remaining for further processing : 98
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 0
% 0.18/0.48 # Generated clauses : 6
% 0.18/0.48 # ...of the previous two non-redundant : 4
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 6
% 0.18/0.48 # Paramodulations : 6
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Total rewrite steps : 0
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 50
% 0.18/0.48 # Positive orientable unit clauses : 0
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 0
% 0.18/0.48 # Non-unit-clauses : 50
% 0.18/0.48 # Current number of unprocessed clauses: 0
% 0.18/0.48 # ...number of literals in the above : 0
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 48
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 1047
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 372
% 0.18/0.48 # Non-unit clause-clause subsumptions : 7
% 0.18/0.48 # Unit Clause-clause subsumption calls : 0
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 0
% 0.18/0.48 # BW rewrite match successes : 0
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 4912
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.010 s
% 0.18/0.48 # System time : 0.002 s
% 0.18/0.48 # Total time : 0.012 s
% 0.18/0.48 # Maximum resident set size: 1896 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.012 s
% 0.18/0.48 # System time : 0.003 s
% 0.18/0.48 # Total time : 0.015 s
% 0.18/0.48 # Maximum resident set size: 1704 pages
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------