TSTP Solution File: ITP019^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP019^5 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Mon May 20 22:15:44 EDT 2024
% Result : Theorem 3.61s 3.09s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 20 ( 19 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 133 ( 12 ~; 4 |; 2 &; 112 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
tp__ty_2Enum_2Enum: $tType ).
thf(decl_sort2,type,
tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: $tType ).
thf(decl_26,type,
ap: $i > $i > $i ).
thf(decl_87,type,
inj__ty_2Enum_2Enum: tp__ty_2Enum_2Enum > $i ).
thf(decl_90,type,
fo__c_2Enum_2E0: tp__ty_2Enum_2Enum ).
thf(decl_2326,type,
inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal > $i ).
thf(decl_2327,type,
surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: $i > tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal ).
thf(decl_2588,type,
c_2Ecomplex_2Ecomplex__inv: $i ).
thf(decl_2591,type,
c_2Ecomplex_2Ecomplex__of__num: $i ).
thf(decl_2601,type,
esk1_0: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal ).
thf(conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ,conjecture,
! [X26849: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X26849
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
=> ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X26849 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ) ).
thf(conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0,axiom,
! [X26848: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X26848 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
<=> ( X26848
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0) ).
thf(c_0_2,negated_conjecture,
~ ! [X26849: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X26849
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
=> ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X26849 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ])]) ).
thf(c_0_3,plain,
! [X27023: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X27023 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
| ( X27023
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) )
& ( ( X27023
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
| ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X27023 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0])])]) ).
thf(c_0_4,negated_conjecture,
( ( esk1_0
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
& ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk1_0 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_5,plain,
! [X24057: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X24057
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
| ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X24057 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk1_0 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( esk1_0
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X24057: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X24057
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk1_0 ) ) ) )
| ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X24057 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk1_0 ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk1_0 ) ) )
!= esk1_0 ),
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,plain,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP019^5 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 17:41:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/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
% 3.61/3.09 # Version: 3.1.0-ho
% 3.61/3.09 # Preprocessing class: HMLLSMLLSSLNSFA.
% 3.61/3.09 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 3.61/3.09 # Starting new_bool_8 with 1192s (4) cores
% 3.61/3.09 # Starting post_as_ho5 with 596s (2) cores
% 3.61/3.09 # Starting new_bool_9 with 298s (1) cores
% 3.61/3.09 # Starting new_bool_3 with 298s (1) cores
% 3.61/3.09 # post_as_ho5 with pid 9843 completed with status 0
% 3.61/3.09 # Result found by post_as_ho5
% 3.61/3.09 # Preprocessing class: HMLLSMLLSSLNSFA.
% 3.61/3.09 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 3.61/3.09 # Starting new_bool_8 with 1192s (4) cores
% 3.61/3.09 # Starting post_as_ho5 with 596s (2) cores
% 3.61/3.09 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 3.61/3.09 # Search class: HGUSM-FSLM32-DSFFFFNN
% 3.61/3.09 # partial match(2): FGUSM-FSLM32-DFFFFFNN
% 3.61/3.09 # Scheduled 6 strats onto 2 cores with 596 seconds (596 total)
% 3.61/3.09 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 322s (1) cores
% 3.61/3.09 # Starting post_as_ho5 with 60s (1) cores
% 3.61/3.09 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9851 completed with status 0
% 3.61/3.09 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.61/3.09 # Preprocessing class: HMLLSMLLSSLNSFA.
% 3.61/3.09 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 3.61/3.09 # Starting new_bool_8 with 1192s (4) cores
% 3.61/3.09 # Starting post_as_ho5 with 596s (2) cores
% 3.61/3.09 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 3.61/3.09 # Search class: HGUSM-FSLM32-DSFFFFNN
% 3.61/3.09 # partial match(2): FGUSM-FSLM32-DFFFFFNN
% 3.61/3.09 # Scheduled 6 strats onto 2 cores with 596 seconds (596 total)
% 3.61/3.09 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 322s (1) cores
% 3.61/3.09 # Preprocessing time : 0.009 s
% 3.61/3.09 # Presaturation interreduction done
% 3.61/3.09
% 3.61/3.09 # Proof found!
% 3.61/3.09 # SZS status Theorem
% 3.61/3.09 # SZS output start CNFRefutation
% See solution above
% 3.61/3.09 # Parsed axioms : 17048
% 3.61/3.09 # Removed by relevancy pruning/SinE : 16976
% 3.61/3.09 # Initial clauses : 172
% 3.61/3.09 # Removed in clause preprocessing : 21
% 3.61/3.09 # Initial clauses in saturation : 151
% 3.61/3.09 # Processed clauses : 179
% 3.61/3.09 # ...of these trivial : 4
% 3.61/3.09 # ...subsumed : 5
% 3.61/3.09 # ...remaining for further processing : 170
% 3.61/3.09 # Other redundant clauses eliminated : 10
% 3.61/3.09 # Clauses deleted for lack of memory : 0
% 3.61/3.09 # Backward-subsumed : 0
% 3.61/3.09 # Backward-rewritten : 1
% 3.61/3.09 # Generated clauses : 13
% 3.61/3.09 # ...of the previous two non-redundant : 9
% 3.61/3.09 # ...aggressively subsumed : 0
% 3.61/3.09 # Contextual simplify-reflections : 0
% 3.61/3.09 # Paramodulations : 2
% 3.61/3.09 # Factorizations : 0
% 3.61/3.09 # NegExts : 0
% 3.61/3.09 # Equation resolutions : 11
% 3.61/3.09 # Disequality decompositions : 0
% 3.61/3.09 # Total rewrite steps : 58
% 3.61/3.09 # ...of those cached : 47
% 3.61/3.09 # Propositional unsat checks : 0
% 3.61/3.09 # Propositional check models : 0
% 3.61/3.09 # Propositional check unsatisfiable : 0
% 3.61/3.09 # Propositional clauses : 0
% 3.61/3.09 # Propositional clauses after purity: 0
% 3.61/3.09 # Propositional unsat core size : 0
% 3.61/3.09 # Propositional preprocessing time : 0.000
% 3.61/3.09 # Propositional encoding time : 0.000
% 3.61/3.09 # Propositional solver time : 0.000
% 3.61/3.09 # Success case prop preproc time : 0.000
% 3.61/3.09 # Success case prop encoding time : 0.000
% 3.61/3.09 # Success case prop solver time : 0.000
% 3.61/3.09 # Current number of processed clauses : 20
% 3.61/3.09 # Positive orientable unit clauses : 14
% 3.61/3.09 # Positive unorientable unit clauses: 0
% 3.61/3.09 # Negative unit clauses : 2
% 3.61/3.09 # Non-unit-clauses : 4
% 3.61/3.09 # Current number of unprocessed clauses: 120
% 3.61/3.09 # ...number of literals in the above : 517
% 3.61/3.09 # Current number of archived formulas : 0
% 3.61/3.09 # Current number of archived clauses : 140
% 3.61/3.09 # Clause-clause subsumption calls (NU) : 3803
% 3.61/3.09 # Rec. Clause-clause subsumption calls : 213
% 3.61/3.09 # Non-unit clause-clause subsumptions : 5
% 3.61/3.09 # Unit Clause-clause subsumption calls : 0
% 3.61/3.09 # Rewrite failures with RHS unbound : 0
% 3.61/3.09 # BW rewrite match attempts : 120
% 3.61/3.09 # BW rewrite match successes : 9
% 3.61/3.09 # Condensation attempts : 0
% 3.61/3.09 # Condensation successes : 0
% 3.61/3.09 # Termbank termtop insertions : 1094549
% 3.61/3.09 # Search garbage collected termcells : 358910
% 3.61/3.09
% 3.61/3.09 # -------------------------------------------------
% 3.61/3.09 # User time : 0.248 s
% 3.61/3.09 # System time : 0.111 s
% 3.61/3.09 # Total time : 0.359 s
% 3.61/3.09 # Maximum resident set size: 73300 pages
% 3.61/3.09
% 3.61/3.09 # -------------------------------------------------
% 3.61/3.09 # User time : 2.387 s
% 3.61/3.09 # System time : 0.237 s
% 3.61/3.09 # Total time : 2.624 s
% 3.61/3.09 # Maximum resident set size: 66672 pages
% 3.61/3.09 % E---3.1 exiting
% 3.61/3.09 % E exiting
%------------------------------------------------------------------------------