TSTP Solution File: SYO354^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO354^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:42 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 7 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 0 avg)
% Number of connectives : 46 ( 6 ~; 2 |; 2 &; 30 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 15 ( 4 ^ 11 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
n: $i > $i ).
thf(decl_23,type,
m: $i > $i ).
thf(decl_24,type,
epred1_0: ( $i > $i ) > $o ).
thf(cE4EXT,conjecture,
( ! [X1: $i,X2: $i > $o] :
( ( X2 @ ( m @ X1 ) )
=> ( X2 @ ( n @ X1 ) ) )
=> ! [X3: ( $i > $i ) > $o] :
( ( X3
@ ^ [X1: $i] : ( m @ X1 ) )
=> ( X3
@ ^ [X1: $i] : ( n @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE4EXT) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i,X2: $i > $o] :
( ( X2 @ ( m @ X1 ) )
=> ( X2 @ ( n @ X1 ) ) )
=> ! [X3: ( $i > $i ) > $o] :
( ( X3
@ ^ [Z0: $i] : ( m @ Z0 ) )
=> ( X3
@ ^ [Z0: $i] : ( n @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cE4EXT])]) ).
thf(c_0_2,negated_conjecture,
! [X7: $i,X8: $i > $o] :
( ( ~ ( X8 @ ( m @ X7 ) )
| ( X8 @ ( n @ X7 ) ) )
& ( epred1_0 @ m )
& ~ ( epred1_0 @ n ) ),
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,
~ ( epred1_0 @ n ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
epred1_0 @ m,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( X2 @ ( n @ X1 ) )
| ~ ( X2 @ ( m @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,plain,
m != n,
inference(ext_sup,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( m @ X1 )
= ( n @ X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_8,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO354^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n006.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon May 20 09:03:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.21/0.49 # Starting sh2lt with 300s (1) cores
% 0.21/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.49 # sh2lt with pid 19664 completed with status 0
% 0.21/0.49 # Result found by sh2lt
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.21/0.49 # Starting sh2lt with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.49 # Search class: HHUNF-FFSF11-SHHFFSBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 163s (1) cores
% 0.21/0.49 # ho_unfolding_3 with pid 19668 completed with status 0
% 0.21/0.49 # Result found by ho_unfolding_3
% 0.21/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.21/0.49 # Starting sh2lt with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.49 # Search class: HHUNF-FFSF11-SHHFFSBN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting ho_unfolding_3 with 163s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 3
% 0.21/0.49 # Removed by relevancy pruning/SinE : 2
% 0.21/0.49 # Initial clauses : 3
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 3
% 0.21/0.49 # Processed clauses : 8
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 8
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 1
% 0.21/0.49 # Generated clauses : 5
% 0.21/0.49 # ...of the previous two non-redundant : 4
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 0
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 1
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 2
% 0.21/0.49 # ...of those cached : 0
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 4
% 0.21/0.49 # Positive orientable unit clauses : 2
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 2
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 2
% 0.21/0.49 # ...number of literals in the above : 2
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 4
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 2
% 0.21/0.49 # BW rewrite match successes : 1
% 0.21/0.49 # Condensation attempts : 8
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 329
% 0.21/0.49 # Search garbage collected termcells : 103
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.004 s
% 0.21/0.49 # Maximum resident set size: 1784 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.005 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1728 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------