TSTP Solution File: ITP384_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP384_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Sat May 4 08:10:37 EDT 2024
% Result : Theorem 0.51s 0.85s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 67
% Syntax : Number of formulae : 100 ( 33 unt; 54 typ; 0 def)
% Number of atoms : 78 ( 53 equ)
% Maximal formula atoms : 13 ( 1 avg)
% Number of connectives : 56 ( 24 ~; 19 |; 9 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 21 ( 20 usr)
% Number of type conns : 38 ( 21 >; 17 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 13 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 65 !; 1 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_update_b_update_fun_a_update_a_update_fun_fun$': $tType ).
tff(decl_sort2,type,
'C_update_b_update_fun$': $tType ).
tff(decl_sort3,type,
'B_update_b_update_fun$': $tType ).
tff(decl_sort4,type,
'A_update_c_update_fun_b_update_a_update_fun_b_update_c_update_fun_fun_fun$': $tType ).
tff(decl_sort5,type,
'B_update_a_update_fun$': $tType ).
tff(decl_sort6,type,
'A_update_b_update_fun$': $tType ).
tff(decl_sort7,type,
'B_update_c_update_fun$': $tType ).
tff(decl_sort8,type,
'C_update_c_update_fun$': $tType ).
tff(decl_sort9,type,
'A_update_set$': $tType ).
tff(decl_sort10,type,
'A_update_a_update_fun$': $tType ).
tff(decl_sort11,type,
'A_update_b_update_fun_c_update_a_update_fun_c_update_b_update_fun_fun_fun$': $tType ).
tff(decl_sort12,type,
'B_update_a_update_fun_a_update_b_update_fun_a_update_a_update_fun_fun_fun$': $tType ).
tff(decl_sort13,type,
'A_update_c_update_fun_c_update_a_update_fun_c_update_c_update_fun_fun_fun$': $tType ).
tff(decl_sort14,type,
'B_update_a_update_fun_b_update_b_update_fun_fun$': $tType ).
tff(decl_sort15,type,
'C_update_a_update_fun$': $tType ).
tff(decl_sort16,type,
'A_update_c_update_fun$': $tType ).
tff(decl_sort17,type,
'B_update_a_update_fun_b_update_c_update_fun_fun$': $tType ).
tff(decl_sort18,type,
'A_update_b_update_fun_b_update_a_update_fun_b_update_b_update_fun_fun_fun$': $tType ).
tff(decl_sort19,type,
'C_update_a_update_fun_c_update_b_update_fun_fun$': $tType ).
tff(decl_sort20,type,
'C_update_a_update_fun_c_update_c_update_fun_fun$': $tType ).
tff(decl_54,type,
'fun_app$aj': ( 'B_update_a_update_fun_b_update_b_update_fun_fun$' * 'B_update_a_update_fun$' ) > 'B_update_b_update_fun$' ).
tff(decl_65,type,
'f$': 'B_update_a_update_fun$' ).
tff(decl_72,type,
'id$b': 'A_update_a_update_fun$' ).
tff(decl_91,type,
'fun_app$w': ( 'A_update_c_update_fun_b_update_a_update_fun_b_update_c_update_fun_fun_fun$' * 'A_update_c_update_fun$' ) > 'B_update_a_update_fun_b_update_c_update_fun_fun$' ).
tff(decl_111,type,
'comp$ab': ( 'A_update_c_update_fun$' * 'A_update_a_update_fun$' ) > 'A_update_c_update_fun$' ).
tff(decl_124,type,
'fun_app$ak': ( 'A_update_b_update_fun_b_update_a_update_fun_b_update_b_update_fun_fun_fun$' * 'A_update_b_update_fun$' ) > 'B_update_a_update_fun_b_update_b_update_fun_fun$' ).
tff(decl_155,type,
'comp$b': 'A_update_b_update_fun_c_update_a_update_fun_c_update_b_update_fun_fun_fun$' ).
tff(decl_198,type,
'fun_app$ae': ( 'C_update_a_update_fun_c_update_c_update_fun_fun$' * 'C_update_a_update_fun$' ) > 'C_update_c_update_fun$' ).
tff(decl_208,type,
'iso_register$a': 'A_update_b_update_fun$' > $o ).
tff(decl_229,type,
'register$c': 'A_update_b_update_fun$' > $o ).
tff(decl_230,type,
'comp$a': 'A_update_c_update_fun_b_update_a_update_fun_b_update_c_update_fun_fun_fun$' ).
tff(decl_253,type,
'comp$d': 'A_update_c_update_fun_c_update_a_update_fun_c_update_c_update_fun_fun_fun$' ).
tff(decl_264,type,
'inv_into$b': ( 'A_update_set$' * 'A_update_b_update_fun$' ) > 'B_update_a_update_fun$' ).
tff(decl_272,type,
'comp$aj': ( 'B_update_c_update_fun$' * 'A_update_b_update_fun$' ) > 'A_update_c_update_fun$' ).
tff(decl_287,type,
'fun_app$x': ( 'C_update_a_update_fun_c_update_b_update_fun_fun$' * 'C_update_a_update_fun$' ) > 'C_update_b_update_fun$' ).
tff(decl_294,type,
'id$': 'C_update_c_update_fun$' ).
tff(decl_305,type,
'id$a': 'B_update_b_update_fun$' ).
tff(decl_329,type,
'fun_app$v': ( 'B_update_a_update_fun_b_update_c_update_fun_fun$' * 'B_update_a_update_fun$' ) > 'B_update_c_update_fun$' ).
tff(decl_353,type,
'fun_app$ad': ( 'B_update_a_update_fun_a_update_b_update_fun_a_update_a_update_fun_fun_fun$' * 'B_update_a_update_fun$' ) > 'A_update_b_update_fun_a_update_a_update_fun_fun$' ).
tff(decl_355,type,
'fun_app$ac': ( 'A_update_b_update_fun_a_update_a_update_fun_fun$' * 'A_update_b_update_fun$' ) > 'A_update_a_update_fun$' ).
tff(decl_404,type,
'comp$': ( 'B_update_c_update_fun$' * 'C_update_b_update_fun$' ) > 'C_update_c_update_fun$' ).
tff(decl_433,type,
'top$': 'A_update_set$' ).
tff(decl_441,type,
'register$a': 'B_update_a_update_fun$' > $o ).
tff(decl_462,type,
'comp$ae': ( 'B_update_a_update_fun$' * 'C_update_b_update_fun$' ) > 'C_update_a_update_fun$' ).
tff(decl_464,type,
'f$a': 'A_update_b_update_fun$' ).
tff(decl_481,type,
'comp$aa': ( 'A_update_a_update_fun$' * 'C_update_a_update_fun$' ) > 'C_update_a_update_fun$' ).
tff(decl_492,type,
'fun_app$y': ( 'A_update_b_update_fun_c_update_a_update_fun_c_update_b_update_fun_fun_fun$' * 'A_update_b_update_fun$' ) > 'C_update_a_update_fun_c_update_b_update_fun_fun$' ).
tff(decl_497,type,
'inj_on$': ( 'A_update_b_update_fun$' * 'A_update_set$' ) > $o ).
tff(decl_538,type,
'comp$c': 'B_update_a_update_fun_a_update_b_update_fun_a_update_a_update_fun_fun_fun$' ).
tff(decl_551,type,
'g$a': 'C_update_a_update_fun$' ).
tff(decl_579,type,
'comp$e': 'A_update_b_update_fun_b_update_a_update_fun_b_update_b_update_fun_fun_fun$' ).
tff(decl_581,type,
'g$': 'A_update_c_update_fun$' ).
tff(decl_582,type,
'fun_app$af': ( 'A_update_c_update_fun_c_update_a_update_fun_c_update_c_update_fun_fun_fun$' * 'A_update_c_update_fun$' ) > 'C_update_a_update_fun_c_update_c_update_fun_fun$' ).
tff(decl_614,type,
esk6_1: 'A_update_b_update_fun$' > 'B_update_a_update_fun$' ).
tff(axiom455,axiom,
! [X1377: 'A_update_b_update_fun$',X1378: 'B_update_a_update_fun$'] :
( ( ( 'fun_app$aj'('fun_app$ak'('comp$e',X1377),X1378) = 'id$a' )
& ( 'fun_app$ac'('fun_app$ad'('comp$c',X1378),X1377) = 'id$b' ) )
=> ( 'inv_into$b'('top$',X1377) = X1378 ) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom455) ).
tff(conjecture29,conjecture,
'comp$'('fun_app$v'('fun_app$w'('comp$a','g$'),'f$'),'fun_app$x'('fun_app$y'('comp$b','f$a'),'g$a')) = 'id$',
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',conjecture29) ).
tff(axiom479,axiom,
! [X1401: 'A_update_b_update_fun$',X1402: 'A_update_c_update_fun$'] :
( 'inj_on$'(X1401,'top$')
=> ( 'comp$aj'('fun_app$v'('fun_app$w'('comp$a',X1402),'inv_into$b'('top$',X1401)),X1401) = X1402 ) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom479) ).
tff(axiom179,axiom,
! [X478: 'A_update_c_update_fun$',X479: 'B_update_a_update_fun$',X480: 'A_update_b_update_fun$'] : ( 'comp$ab'(X478,'fun_app$ac'('fun_app$ad'('comp$c',X479),X480)) = 'comp$aj'('fun_app$v'('fun_app$w'('comp$a',X478),X479),X480) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom179) ).
tff(axiom575,axiom,
! [X1677: 'A_update_b_update_fun$'] :
( 'inj_on$'(X1677,'top$')
<=> ( 'fun_app$ac'('fun_app$ad'('comp$c','inv_into$b'('top$',X1677)),X1677) = 'id$b' ) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom575) ).
tff(axiom67,axiom,
'fun_app$aj'('fun_app$ak'('comp$e','f$a'),'f$') = 'id$a',
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom67) ).
tff(axiom69,axiom,
'fun_app$ac'('fun_app$ad'('comp$c','f$'),'f$a') = 'id$b',
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom69) ).
tff(axiom170,axiom,
! [X454: 'A_update_c_update_fun$',X455: 'B_update_a_update_fun$',X456: 'C_update_b_update_fun$'] : ( 'comp$'('fun_app$v'('fun_app$w'('comp$a',X454),X455),X456) = 'fun_app$ae'('fun_app$af'('comp$d',X454),'comp$ae'(X455,X456)) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom170) ).
tff(axiom187,axiom,
! [X501: 'B_update_c_update_fun$',X2: 'A_update_b_update_fun$',X502: 'C_update_a_update_fun$'] : ( 'comp$'(X501,'fun_app$x'('fun_app$y'('comp$b',X2),X502)) = 'fun_app$ae'('fun_app$af'('comp$d','comp$aj'(X501,X2)),X502) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom187) ).
tff(axiom186,axiom,
! [X499: 'B_update_a_update_fun$',X2: 'A_update_b_update_fun$',X500: 'C_update_a_update_fun$'] : ( 'comp$ae'(X499,'fun_app$x'('fun_app$y'('comp$b',X2),X500)) = 'comp$aa'('fun_app$ac'('fun_app$ad'('comp$c',X499),X2),X500) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom186) ).
tff(axiom96,axiom,
! [X173: 'A_update_b_update_fun$'] :
( 'iso_register$a'(X173)
<=> ( 'register$c'(X173)
& ? [X174: 'B_update_a_update_fun$'] :
( 'register$a'(X174)
& ( 'fun_app$aj'('fun_app$ak'('comp$e',X173),X174) = 'id$a' )
& ( 'fun_app$ac'('fun_app$ad'('comp$c',X174),X173) = 'id$b' ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom96) ).
tff(axiom31,axiom,
'iso_register$a'('f$a'),
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom31) ).
tff(axiom42,axiom,
'fun_app$ae'('fun_app$af'('comp$d','g$'),'g$a') = 'id$',
file('/export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p',axiom42) ).
tff(c_0_13,plain,
! [X2144: 'A_update_b_update_fun$',X2145: 'B_update_a_update_fun$'] :
( ( 'fun_app$aj'('fun_app$ak'('comp$e',X2144),X2145) != 'id$a' )
| ( 'fun_app$ac'('fun_app$ad'('comp$c',X2145),X2144) != 'id$b' )
| ( 'inv_into$b'('top$',X2144) = X2145 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom455])])]) ).
tff(c_0_14,negated_conjecture,
'comp$'('fun_app$v'('fun_app$w'('comp$a','g$'),'f$'),'fun_app$x'('fun_app$y'('comp$b','f$a'),'g$a')) != 'id$',
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture29])]) ).
tff(c_0_15,plain,
! [X1939: 'A_update_b_update_fun$',X1940: 'A_update_c_update_fun$'] :
( ~ 'inj_on$'(X1939,'top$')
| ( 'comp$aj'('fun_app$v'('fun_app$w'('comp$a',X1940),'inv_into$b'('top$',X1939)),X1939) = X1940 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom479])])]) ).
tff(c_0_16,plain,
! [X1936: 'A_update_c_update_fun$',X1937: 'B_update_a_update_fun$',X1938: 'A_update_b_update_fun$'] : ( 'comp$ab'(X1936,'fun_app$ac'('fun_app$ad'('comp$c',X1937),X1938)) = 'comp$aj'('fun_app$v'('fun_app$w'('comp$a',X1936),X1937),X1938) ),
inference(variable_rename,[status(thm)],[axiom179]) ).
tff(c_0_17,plain,
! [X2152: 'A_update_b_update_fun$'] :
( ( ~ 'inj_on$'(X2152,'top$')
| ( 'fun_app$ac'('fun_app$ad'('comp$c','inv_into$b'('top$',X2152)),X2152) = 'id$b' ) )
& ( ( 'fun_app$ac'('fun_app$ad'('comp$c','inv_into$b'('top$',X2152)),X2152) != 'id$b' )
| 'inj_on$'(X2152,'top$') ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom575])])]) ).
tcf(c_0_18,plain,
! [X6: 'B_update_a_update_fun$',X2: 'A_update_b_update_fun$'] :
( ( 'inv_into$b'('top$',X2) = X6 )
| ( 'fun_app$aj'('fun_app$ak'('comp$e',X2),X6) != 'id$a' )
| ( 'fun_app$ac'('fun_app$ad'('comp$c',X6),X2) != 'id$b' ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_19,plain,
'fun_app$aj'('fun_app$ak'('comp$e','f$a'),'f$') = 'id$a',
inference(split_conjunct,[status(thm)],[axiom67]) ).
tcf(c_0_20,plain,
'fun_app$ac'('fun_app$ad'('comp$c','f$'),'f$a') = 'id$b',
inference(split_conjunct,[status(thm)],[axiom69]) ).
tff(c_0_21,negated_conjecture,
'comp$'('fun_app$v'('fun_app$w'('comp$a','g$'),'f$'),'fun_app$x'('fun_app$y'('comp$b','f$a'),'g$a')) != 'id$',
inference(fof_nnf,[status(thm)],[c_0_14]) ).
tff(c_0_22,plain,
! [X1895: 'A_update_c_update_fun$',X1896: 'B_update_a_update_fun$',X1897: 'C_update_b_update_fun$'] : ( 'comp$'('fun_app$v'('fun_app$w'('comp$a',X1895),X1896),X1897) = 'fun_app$ae'('fun_app$af'('comp$d',X1895),'comp$ae'(X1896,X1897)) ),
inference(variable_rename,[status(thm)],[axiom170]) ).
tff(c_0_23,plain,
! [X1898: 'B_update_c_update_fun$',X1899: 'A_update_b_update_fun$',X1900: 'C_update_a_update_fun$'] : ( 'comp$'(X1898,'fun_app$x'('fun_app$y'('comp$b',X1899),X1900)) = 'fun_app$ae'('fun_app$af'('comp$d','comp$aj'(X1898,X1899)),X1900) ),
inference(variable_rename,[status(thm)],[axiom187]) ).
tff(c_0_24,plain,
! [X1930: 'B_update_a_update_fun$',X1931: 'A_update_b_update_fun$',X1932: 'C_update_a_update_fun$'] : ( 'comp$ae'(X1930,'fun_app$x'('fun_app$y'('comp$b',X1931),X1932)) = 'comp$aa'('fun_app$ac'('fun_app$ad'('comp$c',X1930),X1931),X1932) ),
inference(variable_rename,[status(thm)],[axiom186]) ).
tff(c_0_25,plain,
! [X2103: 'A_update_b_update_fun$',X2105: 'A_update_b_update_fun$',X2106: 'B_update_a_update_fun$'] :
( ( 'register$c'(X2103)
| ~ 'iso_register$a'(X2103) )
& ( 'register$a'(esk6_1(X2103))
| ~ 'iso_register$a'(X2103) )
& ( ( 'fun_app$aj'('fun_app$ak'('comp$e',X2103),esk6_1(X2103)) = 'id$a' )
| ~ 'iso_register$a'(X2103) )
& ( ( 'fun_app$ac'('fun_app$ad'('comp$c',esk6_1(X2103)),X2103) = 'id$b' )
| ~ 'iso_register$a'(X2103) )
& ( ~ 'register$c'(X2105)
| ~ 'register$a'(X2106)
| ( 'fun_app$aj'('fun_app$ak'('comp$e',X2105),X2106) != 'id$a' )
| ( 'fun_app$ac'('fun_app$ad'('comp$c',X2106),X2105) != 'id$b' )
| 'iso_register$a'(X2105) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom96])])])])])])]) ).
tcf(c_0_26,plain,
! [X11: 'A_update_c_update_fun$',X2: 'A_update_b_update_fun$'] :
( ( 'comp$aj'('fun_app$v'('fun_app$w'('comp$a',X11),'inv_into$b'('top$',X2)),X2) = X11 )
| ~ 'inj_on$'(X2,'top$') ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_27,plain,
! [X11: 'A_update_c_update_fun$',X6: 'B_update_a_update_fun$',X2: 'A_update_b_update_fun$'] : 'comp$ab'(X11,'fun_app$ac'('fun_app$ad'('comp$c',X6),X2)) = 'comp$aj'('fun_app$v'('fun_app$w'('comp$a',X11),X6),X2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_28,plain,
! [X2: 'A_update_b_update_fun$'] :
( 'inj_on$'(X2,'top$')
| ( 'fun_app$ac'('fun_app$ad'('comp$c','inv_into$b'('top$',X2)),X2) != 'id$b' ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_29,plain,
'inv_into$b'('top$','f$a') = 'f$',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
tcf(c_0_30,negated_conjecture,
'comp$'('fun_app$v'('fun_app$w'('comp$a','g$'),'f$'),'fun_app$x'('fun_app$y'('comp$b','f$a'),'g$a')) != 'id$',
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_31,plain,
! [X6: 'B_update_a_update_fun$',X11: 'A_update_c_update_fun$',X86: 'C_update_b_update_fun$'] : 'comp$'('fun_app$v'('fun_app$w'('comp$a',X11),X6),X86) = 'fun_app$ae'('fun_app$af'('comp$d',X11),'comp$ae'(X6,X86)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_32,plain,
! [X2: 'A_update_b_update_fun$',X82: 'B_update_c_update_fun$',X4: 'C_update_a_update_fun$'] : 'comp$'(X82,'fun_app$x'('fun_app$y'('comp$b',X2),X4)) = 'fun_app$ae'('fun_app$af'('comp$d','comp$aj'(X82,X2)),X4),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_33,plain,
! [X2: 'A_update_b_update_fun$',X6: 'B_update_a_update_fun$',X4: 'C_update_a_update_fun$'] : 'comp$ae'(X6,'fun_app$x'('fun_app$y'('comp$b',X2),X4)) = 'comp$aa'('fun_app$ac'('fun_app$ad'('comp$c',X6),X2),X4),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_34,plain,
! [X2: 'A_update_b_update_fun$'] :
( ( 'fun_app$ac'('fun_app$ad'('comp$c',esk6_1(X2)),X2) = 'id$b' )
| ~ 'iso_register$a'(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
tcf(c_0_35,plain,
'iso_register$a'('f$a'),
inference(split_conjunct,[status(thm)],[axiom31]) ).
tcf(c_0_36,plain,
! [X11: 'A_update_c_update_fun$',X2: 'A_update_b_update_fun$'] :
( ( 'comp$ab'(X11,'fun_app$ac'('fun_app$ad'('comp$c','inv_into$b'('top$',X2)),X2)) = X11 )
| ~ 'inj_on$'(X2,'top$') ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
tcf(c_0_37,plain,
'inj_on$'('f$a','top$'),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20])]) ).
tcf(c_0_38,negated_conjecture,
'fun_app$ae'('fun_app$af'('comp$d','g$'),'comp$ae'('f$','fun_app$x'('fun_app$y'('comp$b','f$a'),'g$a'))) != 'id$',
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
tcf(c_0_39,plain,
! [X2: 'A_update_b_update_fun$',X11: 'A_update_c_update_fun$',X6: 'B_update_a_update_fun$',X4: 'C_update_a_update_fun$'] : 'fun_app$ae'('fun_app$af'('comp$d',X11),'comp$aa'('fun_app$ac'('fun_app$ad'('comp$c',X6),X2),X4)) = 'fun_app$ae'('fun_app$af'('comp$d','comp$ab'(X11,'fun_app$ac'('fun_app$ad'('comp$c',X6),X2))),X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_33]) ).
tcf(c_0_40,plain,
'fun_app$ac'('fun_app$ad'('comp$c',esk6_1('f$a')),'f$a') = 'id$b',
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
tcf(c_0_41,plain,
! [X11: 'A_update_c_update_fun$'] : 'comp$ab'(X11,'id$b') = X11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_20]),c_0_37])]) ).
tcf(c_0_42,negated_conjecture,
'fun_app$ae'('fun_app$af'('comp$d','g$'),'comp$aa'('id$b','g$a')) != 'id$',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_33]),c_0_20]) ).
tcf(c_0_43,plain,
! [X11: 'A_update_c_update_fun$',X4: 'C_update_a_update_fun$'] : 'fun_app$ae'('fun_app$af'('comp$d',X11),'comp$aa'('id$b',X4)) = 'fun_app$ae'('fun_app$af'('comp$d',X11),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
tcf(c_0_44,plain,
'fun_app$ae'('fun_app$af'('comp$d','g$'),'g$a') = 'id$',
inference(split_conjunct,[status(thm)],[axiom42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ITP384_1 : TPTP v8.1.2. Released v8.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.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 : Fri May 3 12:46:21 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.47/0.66 Running first-order model finding
% 0.47/0.66 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.EVcCgchx5L/E---3.1_20620.p
% 0.51/0.85 # Version: 3.1.0
% 0.51/0.85 # partial match(1): FMLMSMSMSSSNFFN
% 0.51/0.85 # Preprocessing class: FMLMSMMMSSSNFFN.
% 0.51/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.51/0.85 # Starting new_bool_3 with 300s (1) cores
% 0.51/0.85 # Starting new_bool_1 with 300s (1) cores
% 0.51/0.85 # Starting sh5l with 300s (1) cores
% 0.51/0.85 # new_bool_3 with pid 20698 completed with status 0
% 0.51/0.85 # Result found by new_bool_3
% 0.51/0.85 # partial match(1): FMLMSMSMSSSNFFN
% 0.51/0.85 # Preprocessing class: FMLMSMMMSSSNFFN.
% 0.51/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.51/0.85 # Starting new_bool_3 with 300s (1) cores
% 0.51/0.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.51/0.85 # Search class: FHUSM-FFLM21-MFFFFFNN
% 0.51/0.85 # partial match(2): FHUSM-FFSF21-MFFFFFNN
% 0.51/0.85 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.51/0.85 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.51/0.85 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20701 completed with status 0
% 0.51/0.85 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.51/0.85 # partial match(1): FMLMSMSMSSSNFFN
% 0.51/0.85 # Preprocessing class: FMLMSMMMSSSNFFN.
% 0.51/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.51/0.85 # Starting new_bool_3 with 300s (1) cores
% 0.51/0.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.51/0.85 # Search class: FHUSM-FFLM21-MFFFFFNN
% 0.51/0.85 # partial match(2): FHUSM-FFSF21-MFFFFFNN
% 0.51/0.85 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.51/0.85 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.51/0.85 # Preprocessing time : 0.007 s
% 0.51/0.85 # Presaturation interreduction done
% 0.51/0.85
% 0.51/0.85 # Proof found!
% 0.51/0.85 # SZS status Theorem
% 0.51/0.85 # SZS output start CNFRefutation
% See solution above
% 0.51/0.85 # Parsed axioms : 1470
% 0.51/0.85 # Removed by relevancy pruning/SinE : 1346
% 0.51/0.85 # Initial clauses : 160
% 0.51/0.85 # Removed in clause preprocessing : 6
% 0.51/0.85 # Initial clauses in saturation : 154
% 0.51/0.85 # Processed clauses : 881
% 0.51/0.85 # ...of these trivial : 42
% 0.51/0.85 # ...subsumed : 292
% 0.51/0.85 # ...remaining for further processing : 547
% 0.51/0.85 # Other redundant clauses eliminated : 113
% 0.51/0.85 # Clauses deleted for lack of memory : 0
% 0.51/0.85 # Backward-subsumed : 6
% 0.51/0.85 # Backward-rewritten : 22
% 0.51/0.85 # Generated clauses : 2347
% 0.51/0.85 # ...of the previous two non-redundant : 1765
% 0.51/0.85 # ...aggressively subsumed : 0
% 0.51/0.85 # Contextual simplify-reflections : 37
% 0.51/0.85 # Paramodulations : 2229
% 0.51/0.85 # Factorizations : 0
% 0.51/0.85 # NegExts : 0
% 0.51/0.85 # Equation resolutions : 118
% 0.51/0.85 # Disequality decompositions : 0
% 0.51/0.85 # Total rewrite steps : 1531
% 0.51/0.85 # ...of those cached : 1354
% 0.51/0.85 # Propositional unsat checks : 0
% 0.51/0.85 # Propositional check models : 0
% 0.51/0.85 # Propositional check unsatisfiable : 0
% 0.51/0.85 # Propositional clauses : 0
% 0.51/0.85 # Propositional clauses after purity: 0
% 0.51/0.85 # Propositional unsat core size : 0
% 0.51/0.85 # Propositional preprocessing time : 0.000
% 0.51/0.85 # Propositional encoding time : 0.000
% 0.51/0.85 # Propositional solver time : 0.000
% 0.51/0.85 # Success case prop preproc time : 0.000
% 0.51/0.85 # Success case prop encoding time : 0.000
% 0.51/0.85 # Success case prop solver time : 0.000
% 0.51/0.85 # Current number of processed clauses : 401
% 0.51/0.85 # Positive orientable unit clauses : 77
% 0.51/0.85 # Positive unorientable unit clauses: 0
% 0.51/0.85 # Negative unit clauses : 0
% 0.51/0.85 # Non-unit-clauses : 324
% 0.51/0.85 # Current number of unprocessed clauses: 1135
% 0.51/0.85 # ...number of literals in the above : 3757
% 0.51/0.85 # Current number of archived formulas : 0
% 0.51/0.85 # Current number of archived clauses : 134
% 0.51/0.85 # Clause-clause subsumption calls (NU) : 12660
% 0.51/0.85 # Rec. Clause-clause subsumption calls : 9341
% 0.51/0.85 # Non-unit clause-clause subsumptions : 335
% 0.51/0.85 # Unit Clause-clause subsumption calls : 222
% 0.51/0.85 # Rewrite failures with RHS unbound : 0
% 0.51/0.85 # BW rewrite match attempts : 17
% 0.51/0.85 # BW rewrite match successes : 14
% 0.51/0.85 # Condensation attempts : 0
% 0.51/0.85 # Condensation successes : 0
% 0.51/0.85 # Termbank termtop insertions : 60013
% 0.51/0.85 # Search garbage collected termcells : 9039
% 0.51/0.85
% 0.51/0.85 # -------------------------------------------------
% 0.51/0.85 # User time : 0.102 s
% 0.51/0.85 # System time : 0.016 s
% 0.51/0.85 # Total time : 0.117 s
% 0.51/0.85 # Maximum resident set size: 5204 pages
% 0.51/0.85
% 0.51/0.85 # -------------------------------------------------
% 0.51/0.85 # User time : 0.147 s
% 0.51/0.85 # System time : 0.022 s
% 0.51/0.85 # Total time : 0.169 s
% 0.51/0.85 # Maximum resident set size: 3992 pages
% 0.51/0.85 % E---3.1 exiting
%------------------------------------------------------------------------------