TSTP Solution File: ITP398_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP001_1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:18:24 EDT 2024
% Result : Theorem 0.39s 0.61s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 44
% Syntax : Number of formulae : 50 ( 8 unt; 42 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 17 ( 17 usr)
% Number of type conns : 25 ( 13 >; 12 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 12 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'Bit_ell2_bit_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort2,type,
'Mem_ell2_ccsubspace$': $tType ).
tff(decl_sort3,type,
'Btype_ell2_btype_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort4,type,
'Mem_ell2_mem_ell2_cblinfun$': $tType ).
tff(decl_sort5,type,
'Atype_ell2_atype_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort6,type,
'Bit_bit_prod$': $tType ).
tff(decl_sort7,type,
'Bit_bit_prod_ell2$': $tType ).
tff(decl_sort8,type,
'Mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort9,type,
'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun$': $tType ).
tff(decl_sort10,type,
'Bit_atype_prod_btype_prod_ell2_bit_atype_prod_btype_prod_ell2_cblinfun$': $tType ).
tff(decl_sort11,type,
'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort12,type,
'Bit_atype_prod_btype_prod_ell2_bit_atype_prod_btype_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort13,type,
'Bit$': $tType ).
tff(decl_sort14,type,
'Bit_atype_prod_ell2_bit_atype_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$': $tType ).
tff(decl_sort15,type,
'Bit_ell2_bit_ell2_cblinfun_bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_fun$': $tType ).
tff(decl_sort16,type,
'Bit_atype_prod_btype_prod_ell2$': $tType ).
tff(decl_sort17,type,
'Mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun_fun$': $tType ).
tff(decl_60,type,
'fun_app$c': ( 'Bit_atype_prod_btype_prod_ell2_bit_atype_prod_btype_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Bit_atype_prod_btype_prod_ell2_bit_atype_prod_btype_prod_ell2_cblinfun$' ) > 'Mem_ell2_mem_ell2_cblinfun$' ).
tff(decl_65,type,
'b$a': 'Bit$' ).
tff(decl_69,type,
'register_pair$a': ( 'Bit_atype_prod_ell2_bit_atype_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Btype_ell2_btype_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ) > 'Bit_atype_prod_btype_prod_ell2_bit_atype_prod_btype_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_82,type,
'ket$': 'Bit_bit_prod$' > 'Bit_bit_prod_ell2$' ).
tff(decl_91,type,
'a$a': 'Bit$' ).
tff(decl_96,type,
'top$': 'Mem_ell2_ccsubspace$' ).
tff(decl_101,type,
'pair$': ( 'Bit$' * 'Bit$' ) > 'Bit_bit_prod$' ).
tff(decl_104,type,
'butterfly$': ( 'Bit_atype_prod_btype_prod_ell2$' * 'Bit_atype_prod_btype_prod_ell2$' ) > 'Bit_atype_prod_btype_prod_ell2_bit_atype_prod_btype_prod_ell2_cblinfun$' ).
tff(decl_117,type,
'beta_00$': 'Bit_bit_prod_ell2$' ).
tff(decl_184,type,
'comp$': ( 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Bit_ell2_bit_ell2_cblinfun_bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_fun$' ) > 'Bit_ell2_bit_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_190,type,
'fun_app$a': ( 'Mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Mem_ell2_mem_ell2_cblinfun$' ) > 'Mem_ell2_mem_ell2_cblinfun$' ).
tff(decl_206,type,
'fun_app$': ( 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun$' ) > 'Mem_ell2_mem_ell2_cblinfun$' ).
tff(decl_222,type,
'snd$': 'Bit_ell2_bit_ell2_cblinfun_bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_fun$' ).
tff(decl_236,type,
'x$': 'Bit_ell2_bit_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_257,type,
'uswap$': 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun$' ).
tff(decl_282,type,
'register_pair$': ( 'Bit_ell2_bit_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Bit_ell2_bit_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ) > 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_291,type,
'cblinfun_image$': ( 'Mem_ell2_mem_ell2_cblinfun$' * 'Mem_ell2_ccsubspace$' ) > 'Mem_ell2_ccsubspace$' ).
tff(decl_334,type,
'fun_app$b': ( 'Mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun_fun$' * 'Mem_ell2_mem_ell2_cblinfun$' ) > 'Mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_338,type,
'butterfly$a': ( 'Bit_bit_prod_ell2$' * 'Bit_bit_prod_ell2$' ) > 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun$' ).
tff(decl_370,type,
'a$': 'Atype_ell2_atype_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_384,type,
'psi$': 'Bit_atype_prod_btype_prod_ell2$' ).
tff(decl_386,type,
'cblinfun_compose$': 'Mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun_fun$' ).
tff(decl_417,type,
'register_pair$b': ( 'Bit_ell2_bit_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' * 'Atype_ell2_atype_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ) > 'Bit_atype_prod_ell2_bit_atype_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_453,type,
'b$': 'Btype_ell2_btype_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(decl_465,type,
'phi$': 'Bit_bit_prod_ell2_bit_bit_prod_ell2_cblinfun_mem_ell2_mem_ell2_cblinfun_fun$' ).
tff(conjecture0,conjecture,
'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$','fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$'))),'fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$'))),'top$')) = 'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$')),'cblinfun_image$'('fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$')),'top$'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture0) ).
tff(axiom23,axiom,
! [X47: 'Mem_ell2_mem_ell2_cblinfun$',X48: 'Mem_ell2_mem_ell2_cblinfun$',X49: 'Mem_ell2_ccsubspace$'] : ( 'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$',X47),X48),X49) = 'cblinfun_image$'(X47,'cblinfun_image$'(X48,X49)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom23) ).
tff(c_0_2,negated_conjecture,
'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$','fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$'))),'fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$'))),'top$')) != 'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$')),'cblinfun_image$'('fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$')),'top$'))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture0])]) ).
tff(c_0_3,negated_conjecture,
'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$','fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$'))),'fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$'))),'top$')) != 'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$')),'cblinfun_image$'('fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$')),'top$'))),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
tff(c_0_4,plain,
! [X1681: 'Mem_ell2_mem_ell2_cblinfun$',X1682: 'Mem_ell2_mem_ell2_cblinfun$',X1683: 'Mem_ell2_ccsubspace$'] : ( 'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$',X1681),X1682),X1683) = 'cblinfun_image$'(X1681,'cblinfun_image$'(X1682,X1683)) ),
inference(variable_rename,[status(thm)],[axiom23]) ).
tcf(c_0_5,negated_conjecture,
'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$','fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$'))),'fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$'))),'top$')) != 'cblinfun_image$'('fun_app$'('register_pair$'('x$','comp$'('phi$','snd$')),'uswap$'),'cblinfun_image$'('fun_app$c'('register_pair$a'('register_pair$b'('x$','a$'),'b$'),'butterfly$'('psi$','psi$')),'cblinfun_image$'('fun_app$'('phi$','butterfly$a'('ket$'('pair$'('a$a','b$a')),'beta_00$')),'top$'))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,plain,
! [X37: 'Mem_ell2_mem_ell2_cblinfun$',X38: 'Mem_ell2_mem_ell2_cblinfun$',X40: 'Mem_ell2_ccsubspace$'] : 'cblinfun_image$'('fun_app$a'('fun_app$b'('cblinfun_compose$',X37),X38),X40) = 'cblinfun_image$'(X37,'cblinfun_image$'(X38,X40)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(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.04/0.14 % Problem : ITP001_1 : TPTP v8.2.0. Released v8.1.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 18:06:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --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.39/0.61 # Version: 3.1.0
% 0.39/0.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.39/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.61 # Starting sh5l with 300s (1) cores
% 0.39/0.61 # new_bool_1 with pid 20929 completed with status 0
% 0.39/0.61 # Result found by new_bool_1
% 0.39/0.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.39/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.61 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.39/0.61 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.61 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.61 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20931 completed with status 0
% 0.39/0.61 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.39/0.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.39/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.61 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.39/0.61 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.61 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.61 # Preprocessing time : 0.006 s
% 0.39/0.61 # Presaturation interreduction done
% 0.39/0.61
% 0.39/0.61 # Proof found!
% 0.39/0.61 # SZS status Theorem
% 0.39/0.61 # SZS output start CNFRefutation
% See solution above
% 0.39/0.61 # Parsed axioms : 1264
% 0.39/0.61 # Removed by relevancy pruning/SinE : 1061
% 0.39/0.61 # Initial clauses : 287
% 0.39/0.61 # Removed in clause preprocessing : 45
% 0.39/0.61 # Initial clauses in saturation : 242
% 0.39/0.61 # Processed clauses : 112
% 0.39/0.61 # ...of these trivial : 8
% 0.39/0.61 # ...subsumed : 28
% 0.39/0.61 # ...remaining for further processing : 76
% 0.39/0.61 # Other redundant clauses eliminated : 10
% 0.39/0.61 # Clauses deleted for lack of memory : 0
% 0.39/0.61 # Backward-subsumed : 0
% 0.39/0.61 # Backward-rewritten : 1
% 0.39/0.61 # Generated clauses : 10
% 0.39/0.61 # ...of the previous two non-redundant : 2
% 0.39/0.61 # ...aggressively subsumed : 0
% 0.39/0.61 # Contextual simplify-reflections : 0
% 0.39/0.61 # Paramodulations : 0
% 0.39/0.61 # Factorizations : 0
% 0.39/0.61 # NegExts : 0
% 0.39/0.61 # Equation resolutions : 10
% 0.39/0.61 # Disequality decompositions : 0
% 0.39/0.61 # Total rewrite steps : 17
% 0.39/0.61 # ...of those cached : 7
% 0.39/0.61 # Propositional unsat checks : 0
% 0.39/0.61 # Propositional check models : 0
% 0.39/0.61 # Propositional check unsatisfiable : 0
% 0.39/0.61 # Propositional clauses : 0
% 0.39/0.61 # Propositional clauses after purity: 0
% 0.39/0.61 # Propositional unsat core size : 0
% 0.39/0.61 # Propositional preprocessing time : 0.000
% 0.39/0.61 # Propositional encoding time : 0.000
% 0.39/0.61 # Propositional solver time : 0.000
% 0.39/0.61 # Success case prop preproc time : 0.000
% 0.39/0.61 # Success case prop encoding time : 0.000
% 0.39/0.61 # Success case prop solver time : 0.000
% 0.39/0.61 # Current number of processed clauses : 65
% 0.39/0.61 # Positive orientable unit clauses : 34
% 0.39/0.61 # Positive unorientable unit clauses: 0
% 0.39/0.61 # Negative unit clauses : 2
% 0.39/0.61 # Non-unit-clauses : 29
% 0.39/0.61 # Current number of unprocessed clauses: 132
% 0.39/0.61 # ...number of literals in the above : 268
% 0.39/0.61 # Current number of archived formulas : 0
% 0.39/0.61 # Current number of archived clauses : 1
% 0.39/0.61 # Clause-clause subsumption calls (NU) : 371
% 0.39/0.61 # Rec. Clause-clause subsumption calls : 231
% 0.39/0.61 # Non-unit clause-clause subsumptions : 26
% 0.39/0.61 # Unit Clause-clause subsumption calls : 14
% 0.39/0.61 # Rewrite failures with RHS unbound : 0
% 0.39/0.61 # BW rewrite match attempts : 5
% 0.39/0.61 # BW rewrite match successes : 1
% 0.39/0.61 # Condensation attempts : 0
% 0.39/0.61 # Condensation successes : 0
% 0.39/0.61 # Termbank termtop insertions : 26287
% 0.39/0.61 # Search garbage collected termcells : 8633
% 0.39/0.61
% 0.39/0.61 # -------------------------------------------------
% 0.39/0.61 # User time : 0.029 s
% 0.39/0.61 # System time : 0.010 s
% 0.39/0.61 # Total time : 0.039 s
% 0.39/0.61 # Maximum resident set size: 5080 pages
% 0.39/0.61
% 0.39/0.61 # -------------------------------------------------
% 0.39/0.61 # User time : 0.082 s
% 0.39/0.61 # System time : 0.015 s
% 0.39/0.61 # Total time : 0.097 s
% 0.39/0.61 # Maximum resident set size: 3848 pages
% 0.39/0.61 % E---3.1 exiting
% 0.39/0.62 % E exiting
%------------------------------------------------------------------------------