TSTP Solution File: ITP386_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP386_1 : TPTP v8.1.2. Released v8.0.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 : Sat May 4 08:10:38 EDT 2024
% Result : Theorem 0.45s 1.11s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 33
% Syntax : Number of formulae : 49 ( 12 unt; 28 typ; 0 def)
% Number of atoms : 39 ( 13 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 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 : 25 ( 14 >; 11 *; 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_81,type,
'g$': 'B_b_option_fun_c_c_option_fun_fun$' ).
tff(decl_91,type,
'none$': 'C_option$' ).
tff(decl_127,type,
'fun_app$an': ( 'B_option_c_option_fun$' * 'B_option$' ) > 'C_option$' ).
tff(decl_199,type,
'thesis$': $o ).
tff(decl_262,type,
'fun_app$am': ( 'B_b_option_fun_c_c_option_fun_fun$' * 'B_b_option_fun$' ) > 'C_c_option_fun$' ).
tff(decl_275,type,
'valid_getter_setter$': ( 'C_b_fun$' * 'B_c_c_fun_fun$' ) > $o ).
tff(decl_311,type,
'case_option$c': ( 'C_option$' * 'B_c_option_fun$' ) > 'B_option_c_option_fun$' ).
tff(decl_338,type,
'register_from_getter_setter$a': ( 'C_b_fun$' * 'B_c_c_fun_fun$' ) > 'B_b_option_fun_c_c_option_fun_fun$' ).
tff(decl_341,type,
'register$a': 'B_b_option_fun_c_c_option_fun_fun$' > $o ).
tff(decl_356,type,
'fun_app$m': ( 'C_b_fun$' * 'C$' ) > 'B$' ).
tff(decl_383,type,
'uu$': ( 'B_c_c_fun_fun$' * 'C$' ) > 'B_c_option_fun$' ).
tff(decl_394,type,
'fun_app$j': ( 'C_c_option_fun$' * 'C$' ) > 'C_option$' ).
tff(decl_405,type,
'fun_app$g': ( 'B_b_option_fun$' * 'B$' ) > 'B_option$' ).
tff(decl_419,type,
esk1_2: ( 'B_c_c_fun_fun$' * 'C_b_fun$' ) > 'B_b_option_fun$' ).
tff(decl_420,type,
esk2_2: ( 'B_c_c_fun_fun$' * 'C_b_fun$' ) > 'C$' ).
tff(decl_459,type,
esk41_1: 'B_b_option_fun_c_c_option_fun_fun$' > 'C_b_fun$' ).
tff(decl_460,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/tmp/tmp.Fx5MCGXxpr/E---3.1_16042.p',conjecture72) ).
tff(hypothesis73,hypothesis,
! [X143: 'B_c_c_fun_fun$',X144: 'C_b_fun$'] :
( ( ! [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))) )
& 'valid_getter_setter$'(X144,X143) )
=> 'thesis$' ),
file('/export/starexec/sandbox/tmp/tmp.Fx5MCGXxpr/E---3.1_16042.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/tmp/tmp.Fx5MCGXxpr/E---3.1_16042.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$'] :
( ( X273 = 'register_from_getter_setter$a'(X274,X275) )
& 'valid_getter_setter$'(X274,X275) ) ),
file('/export/starexec/sandbox/tmp/tmp.Fx5MCGXxpr/E---3.1_16042.p',axiom136) ).
tff(axiom75,axiom,
'register$a'('g$'),
file('/export/starexec/sandbox/tmp/tmp.Fx5MCGXxpr/E---3.1_16042.p',axiom75) ).
fof(c_0_5,negated_conjecture,
~ 'thesis$',
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture72])]) ).
tff(c_0_6,hypothesis,
! [X1781: 'B_c_c_fun_fun$',X1782: 'C_b_fun$'] :
( ( '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)))) )
| ~ 'valid_getter_setter$'(X1782,X1781)
| 'thesis$' ),
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_7,negated_conjecture,
~ 'thesis$',
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tcf(c_0_8,hypothesis,
! [X27: 'C_b_fun$',X112: 'B_c_c_fun_fun$'] :
( 'thesis$'
| ( '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)))) )
| ~ 'valid_getter_setter$'(X27,X112) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ 'thesis$',
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_10,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_11,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$'] :
( ( ( X1967 = 'register_from_getter_setter$a'(esk41_1(X1967),esk42_1(X1967)) )
| ~ 'register$a'(X1967) )
& ( 'valid_getter_setter$'(esk41_1(X1967),esk42_1(X1967))
| ~ 'register$a'(X1967) )
& ( ( X1970 != 'register_from_getter_setter$a'(X1971,X1972) )
| ~ 'valid_getter_setter$'(X1971,X1972)
| 'register$a'(X1970) ) ),
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_12,hypothesis,
! [X27: 'C_b_fun$',X112: 'B_c_c_fun_fun$'] :
( ( '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)) )
| ~ 'valid_getter_setter$'(X27,X112) ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
tcf(c_0_13,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_10]) ).
tcf(c_0_14,plain,
! [X55: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ( X55 = 'register_from_getter_setter$a'(esk41_1(X55),esk42_1(X55)) )
| ~ 'register$a'(X55) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,plain,
'register$a'('g$'),
inference(split_conjunct,[status(thm)],[axiom75]) ).
tcf(c_0_16,plain,
! [X55: 'B_b_option_fun_c_c_option_fun_fun$'] :
( 'valid_getter_setter$'(esk41_1(X55),esk42_1(X55))
| ~ 'register$a'(X55) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_17,hypothesis,
! [X27: 'C_b_fun$',X112: 'B_c_c_fun_fun$'] :
( ( '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)) )
| ~ 'valid_getter_setter$'(X27,X112) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_18,plain,
'register_from_getter_setter$a'(esk41_1('g$'),esk42_1('g$')) = 'g$',
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_19,plain,
'valid_getter_setter$'(esk41_1('g$'),esk42_1('g$')),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ITP386_1 : TPTP v8.1.2. Released v8.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:07:03 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.59 Running first-order model finding
% 0.20/0.59 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Fx5MCGXxpr/E---3.1_16042.p
% 0.45/1.11 # Version: 3.1.0
% 0.45/1.11 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.45/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/1.11 # Starting new_bool_3 with 300s (1) cores
% 0.45/1.11 # Starting new_bool_1 with 300s (1) cores
% 0.45/1.11 # Starting sh5l with 300s (1) cores
% 0.45/1.11 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16119 completed with status 0
% 0.45/1.11 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.45/1.11 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.45/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/1.11 # No SInE strategy applied
% 0.45/1.11 # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.45/1.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.45/1.11 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.45/1.11 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.45/1.11 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.45/1.11 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 16128 completed with status 0
% 0.45/1.11 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 0.45/1.11 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.45/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/1.11 # No SInE strategy applied
% 0.45/1.11 # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.45/1.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 0.45/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.45/1.11 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.45/1.11 # Preprocessing time : 0.015 s
% 0.45/1.11 # Presaturation interreduction done
% 0.45/1.11
% 0.45/1.11 # Proof found!
% 0.45/1.11 # SZS status Theorem
% 0.45/1.11 # SZS output start CNFRefutation
% See solution above
% 0.45/1.11 # Parsed axioms : 1223
% 0.45/1.11 # Removed by relevancy pruning/SinE : 0
% 0.45/1.11 # Initial clauses : 1889
% 0.45/1.11 # Removed in clause preprocessing : 687
% 0.45/1.11 # Initial clauses in saturation : 1202
% 0.45/1.11 # Processed clauses : 8509
% 0.45/1.11 # ...of these trivial : 50
% 0.45/1.11 # ...subsumed : 5715
% 0.45/1.11 # ...remaining for further processing : 2744
% 0.45/1.11 # Other redundant clauses eliminated : 576
% 0.45/1.11 # Clauses deleted for lack of memory : 0
% 0.45/1.11 # Backward-subsumed : 12
% 0.45/1.11 # Backward-rewritten : 16
% 0.45/1.11 # Generated clauses : 21916
% 0.45/1.11 # ...of the previous two non-redundant : 18801
% 0.45/1.11 # ...aggressively subsumed : 0
% 0.45/1.11 # Contextual simplify-reflections : 0
% 0.45/1.11 # Paramodulations : 21246
% 0.45/1.11 # Factorizations : 78
% 0.45/1.11 # NegExts : 0
% 0.45/1.11 # Equation resolutions : 603
% 0.45/1.11 # Disequality decompositions : 0
% 0.45/1.11 # Total rewrite steps : 4113
% 0.45/1.11 # ...of those cached : 3343
% 0.45/1.11 # Propositional unsat checks : 0
% 0.45/1.11 # Propositional check models : 0
% 0.45/1.11 # Propositional check unsatisfiable : 0
% 0.45/1.11 # Propositional clauses : 0
% 0.45/1.11 # Propositional clauses after purity: 0
% 0.45/1.11 # Propositional unsat core size : 0
% 0.45/1.11 # Propositional preprocessing time : 0.000
% 0.45/1.11 # Propositional encoding time : 0.000
% 0.45/1.11 # Propositional solver time : 0.000
% 0.45/1.11 # Success case prop preproc time : 0.000
% 0.45/1.11 # Success case prop encoding time : 0.000
% 0.45/1.11 # Success case prop solver time : 0.000
% 0.45/1.11 # Current number of processed clauses : 1537
% 0.45/1.11 # Positive orientable unit clauses : 433
% 0.45/1.11 # Positive unorientable unit clauses: 0
% 0.45/1.11 # Negative unit clauses : 243
% 0.45/1.11 # Non-unit-clauses : 861
% 0.45/1.11 # Current number of unprocessed clauses: 12447
% 0.45/1.11 # ...number of literals in the above : 32136
% 0.45/1.11 # Current number of archived formulas : 0
% 0.45/1.11 # Current number of archived clauses : 983
% 0.45/1.11 # Clause-clause subsumption calls (NU) : 186250
% 0.45/1.11 # Rec. Clause-clause subsumption calls : 135631
% 0.45/1.11 # Non-unit clause-clause subsumptions : 979
% 0.45/1.11 # Unit Clause-clause subsumption calls : 38437
% 0.45/1.11 # Rewrite failures with RHS unbound : 0
% 0.45/1.11 # BW rewrite match attempts : 56
% 0.45/1.11 # BW rewrite match successes : 15
% 0.45/1.11 # Condensation attempts : 0
% 0.45/1.11 # Condensation successes : 0
% 0.45/1.11 # Termbank termtop insertions : 264293
% 0.45/1.11 # Search garbage collected termcells : 17204
% 0.45/1.11
% 0.45/1.11 # -------------------------------------------------
% 0.45/1.11 # User time : 0.455 s
% 0.45/1.11 # System time : 0.029 s
% 0.45/1.11 # Total time : 0.484 s
% 0.45/1.11 # Maximum resident set size: 8084 pages
% 0.45/1.11
% 0.45/1.11 # -------------------------------------------------
% 0.45/1.11 # User time : 2.022 s
% 0.45/1.11 # System time : 0.109 s
% 0.45/1.11 # Total time : 2.132 s
% 0.45/1.11 # Maximum resident set size: 3596 pages
% 0.45/1.11 % E---3.1 exiting
%------------------------------------------------------------------------------