TSTP Solution File: SYO233^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO233^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:13 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 7 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 0 avg)
% Number of connectives : 33 ( 6 ~; 2 |; 1 &; 20 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 ^ 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cN: $i > $i ).
thf(decl_23,type,
cM: $i > $i ).
thf(decl_24,type,
esk1_0: $i ).
thf(cLEIBNIZ,conjecture,
( ! [X1: $i,X2: $i > $o] :
( ( X2 @ ( cM @ X1 ) )
=> ( X2 @ ( cN @ X1 ) ) )
=> ( cM = cN ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cLEIBNIZ) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i,X2: $i > $o] :
( ( X2 @ ( cM @ X1 ) )
=> ( X2 @ ( cN @ X1 ) ) )
=> ( cM = cN ) ),
inference(assume_negation,[status(cth)],[cLEIBNIZ]) ).
thf(c_0_2,negated_conjecture,
! [X5: $i,X6: $i > $o] :
( ( ~ ( X6 @ ( cM @ X5 ) )
| ( X6 @ ( cN @ X5 ) ) )
& ( cM != cN ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
thf(c_0_3,negated_conjecture,
cM != cN,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( X2 @ ( cN @ X1 ) )
| ~ ( X2 @ ( cM @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( cN @ esk1_0 )
!= ( cM @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] :
( ( cN @ X1 )
= ( cM @ X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO233^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.08/0.30 % Computer : n032.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Mon May 20 08:37:07 EDT 2024
% 0.08/0.30 % CPUTime :
% 0.14/0.40 Running higher-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Version: 3.1.0-ho
% 0.14/0.40 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.14/0.40 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting post_as_ho12 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_9 with 300s (1) cores
% 0.14/0.40 # Starting post_as_ho1 with 300s (1) cores
% 0.14/0.40 # Starting post_as_ho4 with 300s (1) cores
% 0.14/0.40 # Starting post_as_ho2 with 300s (1) cores
% 0.14/0.40 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.14/0.40 # Starting full_lambda_10 with 300s (1) cores
% 0.14/0.40 # Starting new_ho_8 with 300s (1) cores
% 0.14/0.40 # new_bool_9 with pid 10547 completed with status 0
% 0.14/0.40 # Result found by new_bool_9
% 0.14/0.40 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.14/0.40 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting post_as_ho12 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_9 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.14/0.40 # Search class: HHUSF-FFSF11-SSSFFMBN
% 0.14/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.14/0.40 # ehoh_best_nonlift with pid 10554 completed with status 0
% 0.14/0.40 # Result found by ehoh_best_nonlift
% 0.14/0.40 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.14/0.40 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting post_as_ho12 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_9 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.14/0.40 # Search class: HHUSF-FFSF11-SSSFFMBN
% 0.14/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 3
% 0.14/0.41 # Removed by relevancy pruning/SinE : 2
% 0.14/0.41 # Initial clauses : 2
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 2
% 0.14/0.41 # Processed clauses : 6
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 6
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 2
% 0.14/0.41 # Generated clauses : 6
% 0.14/0.41 # ...of the previous two non-redundant : 3
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 0
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 1
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 2
% 0.14/0.41 # ...of those cached : 0
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 2
% 0.14/0.41 # Positive orientable unit clauses : 1
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 0
% 0.14/0.41 # Current number of unprocessed clauses: 1
% 0.14/0.41 # ...number of literals in the above : 1
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 4
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 1
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 3
% 0.14/0.41 # BW rewrite match successes : 2
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 248
% 0.14/0.41 # Search garbage collected termcells : 58
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.002 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.003 s
% 0.14/0.41 # Maximum resident set size: 1624 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.004 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.006 s
% 0.14/0.41 # Maximum resident set size: 1696 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------