TSTP Solution File: GRA075+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRA075+1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:41:15 EDT 2024
% Result : Satisfiable 0.20s 0.49s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_17)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_18,plain,
( vertex(X1)
| ~ path(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_19,plain,
( path(X4,X1,X3)
| X1 != head_of(X2)
| X3 != path_cons(X2,empty)
| ~ edge(X2)
| X4 != tail_of(X2)
| ~ vertex(X4)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_20,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]),
[final] ).
cnf(c_0_26,plain,
( path(X1,X2,X3)
| X3 != path_cons(X4,X5)
| X1 != tail_of(X4)
| ~ path(head_of(X4),X2,X5)
| ~ vertex(X1)
| ~ edge(X4) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]),
[final] ).
cnf(c_0_27,plain,
( path(tail_of(X1),X2,X3)
| X3 != path_cons(X1,empty)
| X2 != head_of(X1)
| ~ vertex(X2)
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_20]),
[final] ).
cnf(c_0_28,plain,
( vertex(head_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]),
[final] ).
cnf(c_0_36,plain,
( path(X1,X2,path_cons(X3,empty))
| X1 != tail_of(X3)
| X2 != head_of(X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X3) ),
inference(er,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_37,plain,
( path(tail_of(X1),X2,X3)
| X3 != path_cons(X1,X4)
| ~ path(head_of(X1),X2,X4)
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_20]),
[final] ).
cnf(c_0_38,plain,
( path(tail_of(X1),head_of(X1),X2)
| X2 != path_cons(X1,empty)
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_28]),
[final] ).
cnf(c_0_39,plain,
( tail_of(X1) != tail_of(X2)
| head_of(X1) != head_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X2,X3,X6) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_41,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_48,plain,
( path(X1,X2,path_cons(X3,X4))
| X1 != tail_of(X3)
| ~ path(head_of(X3),X2,X4)
| ~ vertex(X1)
| ~ edge(X3) ),
inference(er,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_49,plain,
( path(X1,head_of(X2),X3)
| X3 != path_cons(X2,empty)
| X1 != tail_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_28]),
[final] ).
cnf(c_0_50,plain,
( path(X1,head_of(X2),path_cons(X2,empty))
| X1 != tail_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_28]),
[final] ).
cnf(c_0_51,plain,
( path(tail_of(X1),X2,path_cons(X1,X3))
| ~ path(head_of(X1),X2,X3)
| ~ edge(X1) ),
inference(er,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_52,plain,
( path(tail_of(X1),X2,path_cons(X1,empty))
| X2 != head_of(X1)
| ~ vertex(X2)
| ~ edge(X1) ),
inference(er,[status(thm)],[c_0_27]),
[final] ).
cnf(c_0_53,plain,
( path(tail_of(X1),head_of(X1),path_cons(X1,empty))
| ~ edge(X1) ),
inference(er,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_54,plain,
( head_of(X1) != head_of(X2)
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X1,X2,X5) ),
inference(er,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_55,plain,
( tail_of(X1) != tail_of(X2)
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X2,X1,X5) ),
inference(er,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_56,plain,
( path(head_of(esk2_3(X1,X2,X3)),X2,esk3_3(X1,X2,X3))
| X3 = path_cons(esk2_3(X1,X2,X3),empty)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_57,plain,
( path(head_of(esk2_3(X1,X2,X3)),X2,esk3_3(X1,X2,X3))
| X2 = head_of(esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_58,plain,
( X1 != head_of(esk2_3(X2,X1,X3))
| X3 != path_cons(esk2_3(X2,X1,X3),empty)
| ~ path(head_of(esk2_3(X2,X1,X3)),X1,X4)
| X3 != path_cons(esk2_3(X2,X1,X3),X4)
| ~ path(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_59,plain,
( precedes(X1,X2,X3)
| ~ precedes(X4,X2,X3)
| ~ sequential(X1,X4)
| ~ on_path(X1,X3)
| ~ path(X5,X6,X3) ),
inference(csr,[status(thm)],[c_0_40,c_0_41]),
[final] ).
cnf(c_0_60,plain,
( X1 = path_cons(esk2_3(X2,X3,X1),esk3_3(X2,X3,X1))
| X1 = path_cons(esk2_3(X2,X3,X1),empty)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_61,plain,
( X1 = path_cons(esk2_3(X2,X3,X1),esk3_3(X2,X3,X1))
| X3 = head_of(esk2_3(X2,X3,X1))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_62,plain,
( precedes(esk5_3(X1,X2,X3),X3,X1)
| sequential(X2,X3)
| ~ precedes(X2,X3,X1)
| ~ path(X4,X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_63,plain,
( X1 = head_of(esk4_4(X2,X3,X4,X1))
| X1 = tail_of(esk4_4(X2,X3,X4,X1))
| ~ path(X2,X3,X4)
| ~ in_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_64,plain,
( X1 = tail_of(esk1_2(X1,X2))
| X2 = tail_of(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_65,plain,
( sequential(X1,esk5_3(X2,X1,X3))
| sequential(X1,X3)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_66,plain,
( precedes(X1,X2,X3)
| ~ sequential(X1,X2)
| ~ on_path(X1,X3)
| ~ on_path(X2,X3)
| ~ path(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_67,plain,
( X2 = X3
| shortest_path(X2,X3,X1)
| ~ less_or_equal(length_of(X1),length_of(esk6_3(X2,X3,X1)))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_68,plain,
( ~ sequential(X1,X2)
| ~ sequential(X1,X3)
| ~ precedes(X3,X2,X4)
| ~ precedes(X1,X2,X4)
| ~ path(X5,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_69,plain,
( path(X1,X2,esk6_3(X1,X2,X3))
| X1 = X2
| shortest_path(X1,X2,X3)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_70,plain,
( X1 = head_of(esk1_2(X2,X1))
| X2 = head_of(esk1_2(X2,X1))
| X2 = X1
| ~ vertex(X2)
| ~ vertex(X1)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_71,plain,
( X1 = tail_of(esk1_2(X1,X2))
| X1 = head_of(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_72,plain,
( X1 = head_of(esk1_2(X2,X1))
| X1 = tail_of(esk1_2(X2,X1))
| X2 = X1
| ~ vertex(X2)
| ~ vertex(X1)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_73,plain,
( less_or_equal(length_of(X4),length_of(X3))
| ~ path(X1,X2,X3)
| ~ shortest_path(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_74,plain,
( on_path(esk4_4(X1,X2,X3,X4),X3)
| ~ path(X1,X2,X3)
| ~ in_path(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_75,plain,
( in_path(tail_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_76,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_77,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_78,plain,
( in_path(head_of(X1),X2)
| ~ path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_79,plain,
( X1 = X2
| sequential(X1,X2)
| ~ edge(X1)
| ~ edge(X2)
| head_of(X1) != tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_80,plain,
( edge(esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_81,plain,
( X1 = tail_of(esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_82,plain,
( vertex(X1)
| ~ path(X2,X3,X4)
| ~ in_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_83,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_84,plain,
( edge(esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_85,plain,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_86,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_87,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_88,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_89,plain,
( edge(X1)
| ~ sequential(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_90,plain,
( ~ edge(X1)
| head_of(X1) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_91,plain,
~ shortest_path(X1,X1,X2),
inference(er,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_92,plain,
~ sequential(X1,X1),
inference(er,[status(thm)],[c_0_47]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRA075+1 : TPTP v8.2.0. Released v6.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n007.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 12:47:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20721 completed with status 1
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.20/0.49 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 151s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 151s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 146s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 20744 completed with status 1
% 0.20/0.49 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.20/0.49 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 151s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 151s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 146s (1) cores
% 0.20/0.49 # Preprocessing time : 0.002 s
% 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 : 12
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 45
% 0.20/0.49 # Removed in clause preprocessing : 1
% 0.20/0.49 # Initial clauses in saturation : 44
% 0.20/0.49 # Processed clauses : 64
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 6
% 0.20/0.49 # ...remaining for further processing : 58
% 0.20/0.49 # Other redundant clauses eliminated : 2
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 20
% 0.20/0.49 # ...of the previous two non-redundant : 20
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 7
% 0.20/0.49 # Paramodulations : 0
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 20
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 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 : 56
% 0.20/0.49 # Positive orientable unit clauses : 0
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 54
% 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 : 0
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 580
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 206
% 0.20/0.49 # Non-unit clause-clause subsumptions : 13
% 0.20/0.49 # Unit Clause-clause subsumption calls : 49
% 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 : 3854
% 0.20/0.49 # Search garbage collected termcells : 921
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.011 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.014 s
% 0.20/0.49 # Maximum resident set size: 1880 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.041 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.049 s
% 0.20/0.49 # Maximum resident set size: 1760 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------