TSTP Solution File: GRA010+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRA010+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Sat May 4 07:46:23 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 65 ( 14 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 71 ( 23 ~; 25 |; 15 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 44 ( 13 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(complete_means_sequential_pairs_and_triangles,conjecture,
( complete
=> ! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Eln9EnCitv/E---3.1_16943.p',complete_means_sequential_pairs_and_triangles) ).
fof(sequential_pairs_and_triangles,axiom,
! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.Eln9EnCitv/E---3.1_16943.p',sequential_pairs_and_triangles) ).
fof(c_0_2,negated_conjecture,
~ ( complete
=> ! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ) ),
inference(assume_negation,[status(cth)],[complete_means_sequential_pairs_and_triangles]) ).
fof(c_0_3,plain,
! [X19,X20,X21,X24] :
( ( on_path(esk5_1(X19),X19)
| ~ path(X20,X21,X19)
| number_of_in(sequential_pairs,X19) = number_of_in(triangles,X19) )
& ( on_path(esk6_1(X19),X19)
| ~ path(X20,X21,X19)
| number_of_in(sequential_pairs,X19) = number_of_in(triangles,X19) )
& ( sequential(esk5_1(X19),esk6_1(X19))
| ~ path(X20,X21,X19)
| number_of_in(sequential_pairs,X19) = number_of_in(triangles,X19) )
& ( ~ triangle(esk5_1(X19),esk6_1(X19),X24)
| ~ path(X20,X21,X19)
| number_of_in(sequential_pairs,X19) = number_of_in(triangles,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_pairs_and_triangles])])])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X16,X17] :
( complete
& path(esk2_0,esk3_0,esk1_0)
& ( ~ on_path(X16,esk1_0)
| ~ on_path(X17,esk1_0)
| ~ sequential(X16,X17)
| triangle(X16,X17,esk4_2(X16,X17)) )
& number_of_in(sequential_pairs,esk1_0) != number_of_in(triangles,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_5,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ triangle(esk5_1(X1),esk6_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( triangle(X1,X2,esk4_2(X1,X2))
| ~ on_path(X1,esk1_0)
| ~ on_path(X2,esk1_0)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( sequential(esk5_1(X1),esk6_1(X1))
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( on_path(esk6_1(X1),X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
number_of_in(sequential_pairs,esk1_0) != number_of_in(triangles,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( on_path(esk5_1(X1),X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ on_path(esk6_1(X1),esk1_0)
| ~ on_path(esk5_1(X1),esk1_0)
| ~ path(X2,X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
on_path(esk6_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
on_path(esk5_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ path(X1,X2,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRA010+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 11:50:36 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Eln9EnCitv/E---3.1_16943.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 17052 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 168s (1) cores
% 0.21/0.52 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 17057 completed with status 0
% 0.21/0.52 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 168s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 19
% 0.21/0.52 # Removed by relevancy pruning/SinE : 7
% 0.21/0.52 # Initial clauses : 44
% 0.21/0.52 # Removed in clause preprocessing : 1
% 0.21/0.52 # Initial clauses in saturation : 43
% 0.21/0.52 # Processed clauses : 145
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 20
% 0.21/0.52 # ...remaining for further processing : 125
% 0.21/0.52 # Other redundant clauses eliminated : 2
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 1
% 0.21/0.52 # Generated clauses : 203
% 0.21/0.52 # ...of the previous two non-redundant : 176
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 10
% 0.21/0.52 # Paramodulations : 192
% 0.21/0.52 # Factorizations : 4
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 6
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 34
% 0.21/0.52 # ...of those cached : 25
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 77
% 0.21/0.52 # Positive orientable unit clauses : 10
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 5
% 0.21/0.52 # Non-unit-clauses : 62
% 0.21/0.52 # Current number of unprocessed clauses: 116
% 0.21/0.52 # ...number of literals in the above : 664
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 46
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 1096
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 508
% 0.21/0.52 # Non-unit clause-clause subsumptions : 29
% 0.21/0.52 # Unit Clause-clause subsumption calls : 125
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 1
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 6486
% 0.21/0.52 # Search garbage collected termcells : 1044
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.016 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 1860 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.019 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.023 s
% 0.21/0.52 # Maximum resident set size: 1724 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------