TSTP Solution File: GRA010+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRA010+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 17:35:55 EDT 2023
% Result : Theorem 0.34s 0.52s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 70 ( 13 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 77 ( 26 ~; 28 |; 15 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 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 : 50 ( 19 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/tmp/tmp.rIvPIIP5Tv/E---3.1_23360.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/sandbox/tmp/tmp.rIvPIIP5Tv/E---3.1_23360.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,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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,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(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])])])])])]) ).
cnf(c_0_5,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_3]) ).
cnf(c_0_6,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_4]) ).
cnf(c_0_7,negated_conjecture,
number_of_in(sequential_pairs,esk1_0) != number_of_in(triangles,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,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_4]) ).
cnf(c_0_9,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( triangle(X1,esk6_1(esk1_0),esk4_2(X1,esk6_1(esk1_0)))
| ~ sequential(X1,esk6_1(esk1_0))
| ~ on_path(X1,esk1_0)
| ~ path(X2,X3,esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
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_4]) ).
cnf(c_0_12,negated_conjecture,
sequential(esk5_1(esk1_0),esk6_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( triangle(esk5_1(esk1_0),esk6_1(esk1_0),esk4_2(esk5_1(esk1_0),esk6_1(esk1_0)))
| ~ path(X1,X2,esk1_0)
| ~ path(X3,X4,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( triangle(esk5_1(esk1_0),esk6_1(esk1_0),esk4_2(esk5_1(esk1_0),esk6_1(esk1_0)))
| ~ path(X1,X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,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_4]) ).
cnf(c_0_16,negated_conjecture,
triangle(esk5_1(esk1_0),esk6_1(esk1_0),esk4_2(esk5_1(esk1_0),esk6_1(esk1_0))),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
~ path(X1,X2,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : GRA010+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n021.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 19:53:59 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.50 Running first-order model finding
% 0.23/0.50 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.rIvPIIP5Tv/E---3.1_23360.p
% 0.34/0.52 # Version: 3.1pre001
% 0.34/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.52 # Starting sh5l with 300s (1) cores
% 0.34/0.52 # new_bool_3 with pid 23495 completed with status 0
% 0.34/0.52 # Result found by new_bool_3
% 0.34/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.52 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.34/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.52 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 181s (1) cores
% 0.34/0.52 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 23501 completed with status 0
% 0.34/0.52 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.34/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.34/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.34/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.52 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.34/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.52 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 181s (1) cores
% 0.34/0.52 # Preprocessing time : 0.002 s
% 0.34/0.52 # Presaturation interreduction done
% 0.34/0.52
% 0.34/0.52 # Proof found!
% 0.34/0.52 # SZS status Theorem
% 0.34/0.52 # SZS output start CNFRefutation
% See solution above
% 0.34/0.52 # Parsed axioms : 18
% 0.34/0.52 # Removed by relevancy pruning/SinE : 11
% 0.34/0.52 # Initial clauses : 29
% 0.34/0.52 # Removed in clause preprocessing : 1
% 0.34/0.52 # Initial clauses in saturation : 28
% 0.34/0.52 # Processed clauses : 67
% 0.34/0.52 # ...of these trivial : 0
% 0.34/0.52 # ...subsumed : 1
% 0.34/0.52 # ...remaining for further processing : 66
% 0.34/0.52 # Other redundant clauses eliminated : 1
% 0.34/0.52 # Clauses deleted for lack of memory : 0
% 0.34/0.52 # Backward-subsumed : 3
% 0.34/0.52 # Backward-rewritten : 1
% 0.34/0.52 # Generated clauses : 42
% 0.34/0.52 # ...of the previous two non-redundant : 32
% 0.34/0.52 # ...aggressively subsumed : 0
% 0.34/0.52 # Contextual simplify-reflections : 3
% 0.34/0.52 # Paramodulations : 40
% 0.34/0.52 # Factorizations : 0
% 0.34/0.52 # NegExts : 0
% 0.34/0.52 # Equation resolutions : 1
% 0.34/0.52 # Total rewrite steps : 11
% 0.34/0.52 # Propositional unsat checks : 0
% 0.34/0.52 # Propositional check models : 0
% 0.34/0.52 # Propositional check unsatisfiable : 0
% 0.34/0.52 # Propositional clauses : 0
% 0.34/0.52 # Propositional clauses after purity: 0
% 0.34/0.52 # Propositional unsat core size : 0
% 0.34/0.52 # Propositional preprocessing time : 0.000
% 0.34/0.52 # Propositional encoding time : 0.000
% 0.34/0.52 # Propositional solver time : 0.000
% 0.34/0.52 # Success case prop preproc time : 0.000
% 0.34/0.52 # Success case prop encoding time : 0.000
% 0.34/0.52 # Success case prop solver time : 0.000
% 0.34/0.52 # Current number of processed clauses : 32
% 0.34/0.52 # Positive orientable unit clauses : 7
% 0.34/0.52 # Positive unorientable unit clauses: 0
% 0.34/0.52 # Negative unit clauses : 3
% 0.34/0.52 # Non-unit-clauses : 22
% 0.34/0.52 # Current number of unprocessed clauses: 21
% 0.34/0.52 # ...number of literals in the above : 76
% 0.34/0.52 # Current number of archived formulas : 0
% 0.34/0.52 # Current number of archived clauses : 33
% 0.34/0.52 # Clause-clause subsumption calls (NU) : 100
% 0.34/0.52 # Rec. Clause-clause subsumption calls : 71
% 0.34/0.52 # Non-unit clause-clause subsumptions : 5
% 0.34/0.52 # Unit Clause-clause subsumption calls : 20
% 0.34/0.52 # Rewrite failures with RHS unbound : 0
% 0.34/0.52 # BW rewrite match attempts : 1
% 0.34/0.52 # BW rewrite match successes : 1
% 0.34/0.52 # Condensation attempts : 0
% 0.34/0.52 # Condensation successes : 0
% 0.34/0.52 # Termbank termtop insertions : 2808
% 0.34/0.52
% 0.34/0.52 # -------------------------------------------------
% 0.34/0.52 # User time : 0.009 s
% 0.34/0.52 # System time : 0.001 s
% 0.34/0.52 # Total time : 0.010 s
% 0.34/0.52 # Maximum resident set size: 1848 pages
% 0.34/0.52
% 0.34/0.52 # -------------------------------------------------
% 0.34/0.52 # User time : 0.012 s
% 0.34/0.52 # System time : 0.002 s
% 0.34/0.52 # Total time : 0.014 s
% 0.34/0.52 # Maximum resident set size: 1708 pages
% 0.34/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------