TSTP Solution File: SYO334^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO334^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Tue May 21 08:45:38 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 32 ( 12 unt; 13 typ; 0 def)
% Number of atoms : 14 ( 9 equ; 0 cnn)
% Maximal formula atoms : 2 ( 0 avg)
% Number of connectives : 236 ( 11 ~; 8 |; 11 &; 194 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 ^ 67 !; 2 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
c: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_sort3,type,
a: $tType ).
thf(decl_22,type,
c_starc: c > c > c ).
thf(decl_23,type,
c_starb: b > b > b ).
thf(decl_24,type,
c_stara: a > a > a ).
thf(decl_25,type,
esk1_0: a > b ).
thf(decl_26,type,
esk2_0: a > c ).
thf(decl_27,type,
esk3_0: b > c ).
thf(decl_28,type,
esk4_1: b > a ).
thf(decl_29,type,
esk5_0: b ).
thf(decl_30,type,
esk6_0: b ).
thf(decl_31,type,
epred1_0: c > $o ).
thf(cTHM270_INST,conjecture,
! [X1: a > b,X2: a > c,X3: b > c] :
( ( ! [X4: a,X5: c > $o] :
( ( X5 @ ( X3 @ ( X1 @ X4 ) ) )
=> ( X5 @ ( X2 @ X4 ) ) )
& ! [X6: b] :
? [X4: a] :
! [X7: b > $o] :
( ( X7 @ ( X1 @ X4 ) )
=> ( X7 @ X6 ) )
& ! [X4: a,X8: a,X9: b > $o] :
( ( X9 @ ( X1 @ ( c_stara @ X4 @ X8 ) ) )
=> ( X9 @ ( c_starb @ ( X1 @ X4 ) @ ( X1 @ X8 ) ) ) )
& ! [X4: a,X10: a,X5: c > $o] :
( ( X5 @ ( X2 @ ( c_stara @ X4 @ X10 ) ) )
=> ( X5 @ ( c_starc @ ( X2 @ X4 ) @ ( X2 @ X10 ) ) ) ) )
=> ! [X11: b,X6: b,X5: c > $o] :
( ( X5 @ ( X3 @ ( c_starb @ X11 @ X6 ) ) )
=> ( X5 @ ( c_starc @ ( X3 @ X11 ) @ ( X3 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM270_INST) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > b,X2: a > c,X3: b > c] :
( ( ! [X4: a,X5: c > $o] :
( ( X5 @ ( X3 @ ( X1 @ X4 ) ) )
=> ( X5 @ ( X2 @ X4 ) ) )
& ! [X6: b] :
? [X4: a] :
! [X7: b > $o] :
( ( X7 @ ( X1 @ X4 ) )
=> ( X7 @ X6 ) )
& ! [X4: a,X8: a,X9: b > $o] :
( ( X9 @ ( X1 @ ( c_stara @ X4 @ X8 ) ) )
=> ( X9 @ ( c_starb @ ( X1 @ X4 ) @ ( X1 @ X8 ) ) ) )
& ! [X4: a,X10: a,X5: c > $o] :
( ( X5 @ ( X2 @ ( c_stara @ X4 @ X10 ) ) )
=> ( X5 @ ( c_starc @ ( X2 @ X4 ) @ ( X2 @ X10 ) ) ) ) )
=> ! [X11: b,X6: b,X5: c > $o] :
( ( X5 @ ( X3 @ ( c_starb @ X11 @ X6 ) ) )
=> ( X5 @ ( c_starc @ ( X3 @ X11 ) @ ( X3 @ X6 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM270_INST]) ).
thf(c_0_2,negated_conjecture,
! [X32: a,X33: c > $o,X34: b,X36: b > $o,X37: a,X38: a,X39: b > $o,X40: a,X41: a,X42: c > $o] :
( ( ~ ( X33 @ ( esk3_0 @ ( esk1_0 @ X32 ) ) )
| ( X33 @ ( esk2_0 @ X32 ) ) )
& ( ~ ( X36 @ ( esk1_0 @ ( esk4_1 @ X34 ) ) )
| ( X36 @ X34 ) )
& ( ~ ( X39 @ ( esk1_0 @ ( c_stara @ X37 @ X38 ) ) )
| ( X39 @ ( c_starb @ ( esk1_0 @ X37 ) @ ( esk1_0 @ X38 ) ) ) )
& ( ~ ( X42 @ ( esk2_0 @ ( c_stara @ X40 @ X41 ) ) )
| ( X42 @ ( c_starc @ ( esk2_0 @ X40 ) @ ( esk2_0 @ X41 ) ) ) )
& ( epred1_0 @ ( esk3_0 @ ( c_starb @ esk5_0 @ esk6_0 ) ) )
& ~ ( epred1_0 @ ( c_starc @ ( esk3_0 @ esk5_0 ) @ ( esk3_0 @ esk6_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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X5: c > $o,X4: a] :
( ( X5 @ ( esk2_0 @ X4 ) )
| ~ ( X5 @ ( esk3_0 @ ( esk1_0 @ X4 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X7: b > $o,X6: b] :
( ( X7 @ X6 )
| ~ ( X7 @ ( esk1_0 @ ( esk4_1 @ X6 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X4: a,X7: b > $o,X8: a] :
( ( X7 @ ( c_starb @ ( esk1_0 @ X4 ) @ ( esk1_0 @ X8 ) ) )
| ~ ( X7 @ ( esk1_0 @ ( c_stara @ X4 @ X8 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a,X5: c > $o,X8: a] :
( ( X5 @ ( c_starc @ ( esk2_0 @ X4 ) @ ( esk2_0 @ X8 ) ) )
| ~ ( X5 @ ( esk2_0 @ ( c_stara @ X4 @ X8 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: a] :
( ( esk3_0 @ ( esk1_0 @ X4 ) )
= ( esk2_0 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X6: b] :
( ( esk1_0 @ ( esk4_1 @ X6 ) )
= X6 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X4: a,X8: a] :
( ( c_starb @ ( esk1_0 @ X4 ) @ ( esk1_0 @ X8 ) )
= ( esk1_0 @ ( c_stara @ X4 @ X8 ) ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_10,negated_conjecture,
! [X4: a,X8: a] :
( ( c_starc @ ( esk2_0 @ X4 ) @ ( esk2_0 @ X8 ) )
= ( esk2_0 @ ( c_stara @ X4 @ X8 ) ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X6: b] :
( ( esk2_0 @ ( esk4_1 @ X6 ) )
= ( esk3_0 @ X6 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X4: a,X6: b] :
( ( esk1_0 @ ( c_stara @ X4 @ ( esk4_1 @ X6 ) ) )
= ( c_starb @ ( esk1_0 @ X4 ) @ X6 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X4: a,X6: b] :
( ( esk2_0 @ ( c_stara @ X4 @ ( esk4_1 @ X6 ) ) )
= ( c_starc @ ( esk2_0 @ X4 ) @ ( esk3_0 @ X6 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X4: a,X6: b] :
( ( c_starc @ ( esk2_0 @ X4 ) @ ( esk3_0 @ X6 ) )
= ( esk3_0 @ ( c_starb @ ( esk1_0 @ X4 ) @ X6 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_13]) ).
thf(c_0_15,negated_conjecture,
~ ( epred1_0 @ ( c_starc @ ( esk3_0 @ esk5_0 ) @ ( esk3_0 @ esk6_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
! [X6: b,X11: b] :
( ( c_starc @ ( esk3_0 @ X6 ) @ ( esk3_0 @ X11 ) )
= ( esk3_0 @ ( c_starb @ X6 @ X11 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_8]) ).
thf(c_0_17,negated_conjecture,
epred1_0 @ ( esk3_0 @ ( c_starb @ esk5_0 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO334^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 08:31:38 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.48 Running higher-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.50 # Version: 3.1.0-ho
% 0.22/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.22/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.22/0.50 # new_bool_9 with pid 20840 completed with status 0
% 0.22/0.50 # Result found by new_bool_9
% 0.22/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.50 # Search class: HHUNF-FFSF21-SSSFFMBN
% 0.22/0.50 # partial match(1): HGUNF-FFSF21-SSSFFMBN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # new_ho_10 with pid 20847 completed with status 9
% 0.22/0.50 # Starting new_bool_9 with 31s (1) cores
% 0.22/0.50 # new_bool_9 with pid 20855 completed with status 0
% 0.22/0.50 # Result found by new_bool_9
% 0.22/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.50 # Search class: HHUNF-FFSF21-SSSFFMBN
% 0.22/0.50 # partial match(1): HGUNF-FFSF21-SSSFFMBN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # new_ho_10 with pid 20847 completed with status 9
% 0.22/0.50 # Starting new_bool_9 with 31s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 7
% 0.22/0.50 # Removed by relevancy pruning/SinE : 6
% 0.22/0.50 # Initial clauses : 6
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 6
% 0.22/0.50 # Processed clauses : 35
% 0.22/0.50 # ...of these trivial : 9
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 26
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 9
% 0.22/0.50 # Generated clauses : 61
% 0.22/0.50 # ...of the previous two non-redundant : 49
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 29
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 32
% 0.22/0.50 # ...of those cached : 18
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 11
% 0.22/0.50 # Positive orientable unit clauses : 11
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 0
% 0.22/0.50 # Non-unit-clauses : 0
% 0.22/0.50 # Current number of unprocessed clauses: 20
% 0.22/0.50 # ...number of literals in the above : 29
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 15
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 6
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 6
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 1
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 7
% 0.22/0.50 # BW rewrite match successes : 7
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 2659
% 0.22/0.50 # Search garbage collected termcells : 391
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.007 s
% 0.22/0.50 # System time : 0.002 s
% 0.22/0.50 # Total time : 0.009 s
% 0.22/0.50 # Maximum resident set size: 1908 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.007 s
% 0.22/0.50 # System time : 0.005 s
% 0.22/0.50 # Total time : 0.012 s
% 0.22/0.50 # Maximum resident set size: 1772 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------