%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP386_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:57:39 PM UTC 2026
% Result : Theorem 4.53s 6.13s
% Output : CNFRefutation 4.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 13 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 12 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 12 ( 11 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 31 !; 2 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'C_c_option_fun$': $tType ).
tff(decl_sort2,type,
'C_option$': $tType ).
tff(decl_sort3,type,
'B_option_c_option_fun$': $tType ).
tff(decl_sort4,type,
'B$': $tType ).
tff(decl_sort5,type,
'C$': $tType ).
tff(decl_sort6,type,
'C_b_fun$': $tType ).
tff(decl_sort7,type,
'B_option$': $tType ).
tff(decl_sort8,type,
'B_b_option_fun_c_c_option_fun_fun$': $tType ).
tff(decl_sort9,type,
'B_b_option_fun$': $tType ).
tff(decl_sort10,type,
'B_c_option_fun$': $tType ).
tff(decl_sort11,type,
'B_c_c_fun_fun$': $tType ).
tff(decl_82,type,
'g$': 'B_b_option_fun_c_c_option_fun_fun$' ).
tff(decl_92,type,
'none$': 'C_option$' ).
tff(decl_128,type,
'fun_app$an': ( 'B_option$' * 'B_option_c_option_fun$' ) > 'C_option$' ).
tff(decl_200,type,
'thesis$': $o ).
tff(decl_263,type,
'fun_app$am': ( 'B_b_option_fun$' * 'B_b_option_fun_c_c_option_fun_fun$' ) > 'C_c_option_fun$' ).
tff(decl_276,type,
'valid_getter_setter$': ( 'B_c_c_fun_fun$' * 'C_b_fun$' ) > $o ).
tff(decl_312,type,
'case_option$c': ( 'B_c_option_fun$' * 'C_option$' ) > 'B_option_c_option_fun$' ).
tff(decl_339,type,
'register_from_getter_setter$a': ( 'B_c_c_fun_fun$' * 'C_b_fun$' ) > 'B_b_option_fun_c_c_option_fun_fun$' ).
tff(decl_342,type,
'register$a': 'B_b_option_fun_c_c_option_fun_fun$' > $o ).
tff(decl_357,type,
'fun_app$m': ( 'C$' * 'C_b_fun$' ) > 'B$' ).
tff(decl_384,type,
'uu$': ( 'C$' * 'B_c_c_fun_fun$' ) > 'B_c_option_fun$' ).
tff(decl_395,type,
'fun_app$j': ( 'C$' * 'C_c_option_fun$' ) > 'C_option$' ).
tff(decl_406,type,
'fun_app$g': ( 'B$' * 'B_b_option_fun$' ) > 'B_option$' ).
tff(decl_420,type,
esk1_2: ( 'C_b_fun$' * 'B_c_c_fun_fun$' ) > 'B_b_option_fun$' ).
tff(decl_421,type,
esk2_2: ( 'C_b_fun$' * 'B_c_c_fun_fun$' ) > 'C$' ).
tff(decl_460,type,
esk41_1: 'B_b_option_fun_c_c_option_fun_fun$' > 'C_b_fun$' ).
tff(decl_461,type,
esk42_1: 'B_b_option_fun_c_c_option_fun_fun$' > 'B_c_c_fun_fun$' ).
fof(conjecture72,conjecture,
'thesis$',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture72) ).
tff(hypothesis73,hypothesis,
! [X143: 'B_c_c_fun_fun$',X144: 'C_b_fun$'] :
( ( 'valid_getter_setter$'(X144,X143)
& ! [X145: 'B_b_option_fun$',X146: 'C$'] : ( 'fun_app$j'('fun_app$am'('g$',X145),X146) = 'fun_app$an'('case_option$c'('none$','uu$'(X143,X146)),'fun_app$g'(X145,'fun_app$m'(X144,X146))) ) )
=> 'thesis$' ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hypothesis73) ).
tff(axiom94,axiom,
! [X184: 'C_b_fun$',X185: 'B_c_c_fun_fun$',X186: 'B_b_option_fun$',X146: 'C$'] : ( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X184,X185),X186),X146) = 'fun_app$an'('case_option$c'('none$','uu$'(X185,X146)),'fun_app$g'(X186,'fun_app$m'(X184,X146))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom94) ).
tff(axiom136,axiom,
! [X273: 'B_b_option_fun_c_c_option_fun_fun$'] :
( 'register$a'(X273)
<=> ? [X274: 'C_b_fun$',X275: 'B_c_c_fun_fun$'] :
( 'valid_getter_setter$'(X274,X275)
& ( X273 = 'register_from_getter_setter$a'(X274,X275) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom136) ).
tff(axiom75,axiom,
'register$a'('g$'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom75) ).
fof(c_0_5,negated_conjecture,
~ 'thesis$',
inference(assume_negation,[status(cth)],[conjecture72]) ).
fof(c_0_6,negated_conjecture,
~ 'thesis$',
inference(fof_simplification,[status(thm)],[c_0_5]) ).
tff(c_0_7,hypothesis,
! [X1781: 'B_c_c_fun_fun$',X1782: 'C_b_fun$'] :
( 'thesis$'
| ~ 'valid_getter_setter$'(X1782,X1781)
| ( 'fun_app$j'('fun_app$am'('g$',esk1_2(X1781,X1782)),esk2_2(X1781,X1782)) != 'fun_app$an'('case_option$c'('none$','uu$'(X1781,esk2_2(X1781,X1782))),'fun_app$g'(esk1_2(X1781,X1782),'fun_app$m'(X1782,esk2_2(X1781,X1782)))) ) ),
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)],[hypothesis73])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ 'thesis$',
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tcf(c_0_9,hypothesis,
! [X27: 'C_b_fun$',X112: 'B_c_c_fun_fun$'] :
( ~ 'valid_getter_setter$'(X27,X112)
| ( 'fun_app$j'('fun_app$am'('g$',esk1_2(X112,X27)),esk2_2(X112,X27)) != 'fun_app$an'('case_option$c'('none$','uu$'(X112,esk2_2(X112,X27))),'fun_app$g'(esk1_2(X112,X27),'fun_app$m'(X27,esk2_2(X112,X27)))) )
| 'thesis$' ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ 'thesis$',
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_11,plain,
! [X1854: 'C_b_fun$',X1855: 'B_c_c_fun_fun$',X1856: 'B_b_option_fun$',X1857: 'C$'] : ( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X1854,X1855),X1856),X1857) = 'fun_app$an'('case_option$c'('none$','uu$'(X1855,X1857)),'fun_app$g'(X1856,'fun_app$m'(X1854,X1857))) ),
inference(variable_rename,[status(thm)],[axiom94]) ).
tff(c_0_12,plain,
! [X1967: 'B_b_option_fun_c_c_option_fun_fun$',X1970: 'B_b_option_fun_c_c_option_fun_fun$',X1971: 'C_b_fun$',X1972: 'B_c_c_fun_fun$'] :
( ( 'register$a'(X1970)
| ~ 'valid_getter_setter$'(X1971,X1972)
| ( X1970 != 'register_from_getter_setter$a'(X1971,X1972) ) )
& ( ~ 'register$a'(X1967)
| 'valid_getter_setter$'(esk41_1(X1967),esk42_1(X1967)) )
& ( ~ 'register$a'(X1967)
| ( X1967 = 'register_from_getter_setter$a'(esk41_1(X1967),esk42_1(X1967)) ) ) ),
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)],[axiom136])])])])])])]) ).
tcf(c_0_13,hypothesis,
! [X27: 'C_b_fun$',X112: 'B_c_c_fun_fun$'] :
( ~ 'valid_getter_setter$'(X27,X112)
| ( 'fun_app$an'('case_option$c'('none$','uu$'(X112,esk2_2(X112,X27))),'fun_app$g'(esk1_2(X112,X27),'fun_app$m'(X27,esk2_2(X112,X27)))) != 'fun_app$j'('fun_app$am'('g$',esk1_2(X112,X27)),esk2_2(X112,X27)) ) ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_14,plain,
! [X112: 'B_c_c_fun_fun$',X70: 'B_b_option_fun$',X27: 'C_b_fun$',X6: 'C$'] : 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X27,X112),X70),X6) = 'fun_app$an'('case_option$c'('none$','uu$'(X112,X6)),'fun_app$g'(X70,'fun_app$m'(X27,X6))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,plain,
! [X55: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ~ 'register$a'(X55)
| ( X55 = 'register_from_getter_setter$a'(esk41_1(X55),esk42_1(X55)) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,plain,
'register$a'('g$'),
inference(split_conjunct,[status(thm)],[axiom75]) ).
tcf(c_0_17,plain,
! [X55: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ~ 'register$a'(X55)
| 'valid_getter_setter$'(esk41_1(X55),esk42_1(X55)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_18,hypothesis,
! [X27: 'C_b_fun$',X112: 'B_c_c_fun_fun$'] :
( ~ 'valid_getter_setter$'(X27,X112)
| ( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X27,X112),esk1_2(X112,X27)),esk2_2(X112,X27)) != 'fun_app$j'('fun_app$am'('g$',esk1_2(X112,X27)),esk2_2(X112,X27)) ) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_19,plain,
'register_from_getter_setter$a'(esk41_1('g$'),esk42_1('g$')) = 'g$',
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
tcf(c_0_20,plain,
'valid_getter_setter$'(esk41_1('g$'),esk42_1('g$')),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP386_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.36 % Computer : n026.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sun Sep 20 22:39:12 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.09/5.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 4.53/6.13 % Version: 3.5.1
% 4.53/6.13 % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.53/6.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.53/6.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.53/6.13 % Starting new_bool_3 with 300s (1) cores
% 4.53/6.13 % Starting new_bool_1 with 300s (1) cores
% 4.53/6.13 % Starting sh5l with 300s (1) cores
% 4.53/6.13 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 742264 completed with status 0
% 4.53/6.13 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.53/6.13 % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.53/6.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.53/6.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.53/6.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.53/6.13 % No SInE strategy applied
% 4.53/6.13 % Search class: FGHSM-SSLM32-MFFFFFNN
% 4.53/6.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.53/6.13 % Starting SubtermCWHack with 136s (1) cores
% 4.53/6.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.53/6.13 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.53/6.13 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 4.53/6.13 % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 4.53/6.13 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 742274 completed with status 0
% 4.53/6.13 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 4.53/6.13 % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.53/6.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.53/6.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.53/6.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.53/6.13 % No SInE strategy applied
% 4.53/6.13 % Search class: FGHSM-SSLM32-MFFFFFNN
% 4.53/6.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.53/6.13 % Starting SubtermCWHack with 136s (1) cores
% 4.53/6.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.53/6.13 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.53/6.13 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 4.53/6.13 % Preprocessing time : 0.017 s
% 4.53/6.13 % Presaturation interreduction done
% 4.53/6.13
% 4.53/6.13 % Proof found!
% 4.53/6.13 % SZS status Theorem
% 4.53/6.13 % SZS output start CNFRefutation
% See solution above
% 4.53/6.13 % Parsed axioms : 1223
% 4.53/6.13 % Removed by relevancy pruning/SinE : 0
% 4.53/6.13 % Initial clauses : 1889
% 4.53/6.13 % Removed in clause preprocessing : 687
% 4.53/6.13 % Initial clauses in saturation : 1202
% 4.53/6.13 % Processed clauses : 8509
% 4.53/6.13 % ...of these trivial : 50
% 4.53/6.13 % ...subsumed : 5715
% 4.53/6.13 % ...remaining for further processing : 2744
% 4.53/6.13 % Other redundant clauses eliminated : 576
% 4.53/6.13 % Clauses deleted for lack of memory : 0
% 4.53/6.13 % Backward-subsumed : 12
% 4.53/6.13 % Backward-rewritten : 16
% 4.53/6.13 % Generated clauses : 21916
% 4.53/6.13 % ...of the previous two non-redundant : 18801
% 4.53/6.13 % ...aggressively subsumed : 0
% 4.53/6.13 % Contextual simplify-reflections : 0
% 4.53/6.13 % Paramodulations : 21246
% 4.53/6.13 % Factorizations : 78
% 4.53/6.13 % NegExts : 0
% 4.53/6.13 % Equation resolutions : 603
% 4.53/6.13 % Disequality decompositions : 0
% 4.53/6.13 % Total rewrite steps : 4113
% 4.53/6.13 % ...of those cached : 3343
% 4.53/6.13 % Propositional unsat checks : 0
% 4.53/6.13 % Propositional check models : 0
% 4.53/6.13 % Propositional check unsatisfiable : 0
% 4.53/6.13 % Propositional clauses : 0
% 4.53/6.13 % Propositional clauses after purity: 0
% 4.53/6.13 % Propositional unsat core size : 0
% 4.53/6.13 % Propositional preprocessing time : 0.000
% 4.53/6.13 % Propositional encoding time : 0.000
% 4.53/6.13 % Propositional solver time : 0.000
% 4.53/6.13 % Success case prop preproc time : 0.000
% 4.53/6.13 % Success case prop encoding time : 0.000
% 4.53/6.13 % Success case prop solver time : 0.000
% 4.53/6.13 % Current number of processed clauses : 1537
% 4.53/6.13 % Positive orientable unit clauses : 433
% 4.53/6.13 % Positive unorientable unit clauses: 0
% 4.53/6.13 % Negative unit clauses : 243
% 4.53/6.13 % Non-unit-clauses : 861
% 4.53/6.13 % Current number of unprocessed clauses: 12447
% 4.53/6.13 % ...number of literals in the above : 32136
% 4.53/6.13 % Current number of archived formulas : 0
% 4.53/6.13 % Current number of archived clauses : 983
% 4.53/6.13 % Clause-clause subsumption calls (NU) : 253612
% 4.53/6.13 % Rec. Clause-clause subsumption calls : 188438
% 4.53/6.13 % Non-unit clause-clause subsumptions : 979
% 4.53/6.13 % Unit Clause-clause subsumption calls : 42574
% 4.53/6.13 % Rewrite failures with RHS unbound : 0
% 4.53/6.13 % BW rewrite match attempts : 56
% 4.53/6.13 % BW rewrite match successes : 15
% 4.53/6.13 % Condensation attempts : 0
% 4.53/6.13 % Condensation successes : 0
% 4.53/6.13 % Termbank termtop insertions : 268995
% 4.53/6.13 % Search garbage collected termcells : 17202
% 4.53/6.13
% 4.53/6.13 % -------------------------------------------------
% 4.53/6.13 % User time : 0.602 s
% 4.53/6.13 % System time : 0.046 s
% 4.53/6.13 % Total time : 0.648 s
% 4.53/6.13 % Maximum resident set size: 9872 pages
% 4.53/6.13
% 4.53/6.13 % -------------------------------------------------
% 4.53/6.13 % User time : 2.811 s
% 4.53/6.13 % System time : 0.170 s
% 4.53/6.13 % Total time : 2.981 s
% 4.53/6.13 % Maximum resident set size: 6656 pages
% 4.53/6.13 % E exiting
%------------------------------------------------------------------------------