TSTP Solution File: GRA010+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Sat Jul 16 07:16:08 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% 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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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,
! [X10,X11,X12,X15] :
( ( on_path(esk5_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( on_path(esk6_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( sequential(esk5_1(X10),esk6_1(X10))
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( ~ triangle(esk5_1(X10),esk6_1(X10),X15)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_pairs_and_triangles])])])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X13,X14] :
( complete
& path(esk2_0,esk3_0,esk1_0)
& ( ~ on_path(X13,esk1_0)
| ~ on_path(X14,esk1_0)
| ~ sequential(X13,X14)
| triangle(X13,X14,esk4_2(X13,X14)) )
& number_of_in(sequential_pairs,esk1_0) != number_of_in(triangles,esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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)
| ~ path(X2,X3,X1)
| ~ triangle(esk5_1(X1),esk6_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( triangle(X1,X2,esk4_2(X1,X2))
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk5_1(X1),esk6_1(X1))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk6_1(X1),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,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk5_1(X1),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.06/0.11 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 23:05:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.018 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 17
% 0.22/1.40 # Proof object clause steps : 12
% 0.22/1.40 # Proof object formula steps : 5
% 0.22/1.40 # Proof object conjectures : 11
% 0.22/1.40 # Proof object clause conjectures : 8
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 7
% 0.22/1.40 # Proof object initial formulas used : 2
% 0.22/1.40 # Proof object generating inferences : 4
% 0.22/1.40 # Proof object simplifying inferences : 7
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 18
% 0.22/1.40 # Removed by relevancy pruning/SinE : 11
% 0.22/1.40 # Initial clauses : 29
% 0.22/1.40 # Removed in clause preprocessing : 1
% 0.22/1.40 # Initial clauses in saturation : 28
% 0.22/1.40 # Processed clauses : 51
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 9
% 0.22/1.40 # ...remaining for further processing : 42
% 0.22/1.40 # Other redundant clauses eliminated : 1
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 47
% 0.22/1.40 # ...of the previous two non-trivial : 38
% 0.22/1.40 # Contextual simplify-reflections : 18
% 0.22/1.40 # Paramodulations : 45
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 1
% 0.22/1.40 # Current number of processed clauses : 40
% 0.22/1.40 # Positive orientable unit clauses : 8
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 3
% 0.22/1.40 # Non-unit-clauses : 29
% 0.22/1.40 # Current number of unprocessed clauses: 15
% 0.22/1.40 # ...number of literals in the above : 82
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 1
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 164
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 104
% 0.22/1.40 # Non-unit clause-clause subsumptions : 27
% 0.22/1.40 # Unit Clause-clause subsumption calls : 50
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2663
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.021 s
% 0.22/1.40 # System time : 0.000 s
% 0.22/1.40 # Total time : 0.021 s
% 0.22/1.40 # Maximum resident set size: 3004 pages
%------------------------------------------------------------------------------