%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP322_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:55:25 PM UTC 2026
% Result : Theorem 0.14s 0.76s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 14 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'B$': $tType ).
tff(decl_sort2,type,
'B_set$': $tType ).
tff(decl_sort3,type,
'B_set_b_set_fun$': $tType ).
tff(decl_sort4,type,
'B_set_b_set_b_set_fun_fun$': $tType ).
tff(decl_33,type,
'a$': 'B$' ).
tff(decl_34,type,
'fun_app$b': ( 'B_set$' * 'B_set_b_set_fun$' ) > 'B_set$' ).
tff(decl_48,type,
'uminus$': 'B_set_b_set_fun$' ).
tff(decl_53,type,
'fun_app$c': ( 'B_set$' * 'B_set_b_set_b_set_fun_fun$' ) > 'B_set_b_set_fun$' ).
tff(decl_58,type,
'insert$': 'B$' > 'B_set_b_set_fun$' ).
tff(decl_60,type,
'top$': 'B_set$' ).
tff(decl_66,type,
'minus$': 'B_set_b_set_b_set_fun_fun$' ).
tff(decl_83,type,
'sup$': 'B_set_b_set_b_set_fun_fun$' ).
tff(decl_102,type,
'bot$': 'B_set$' ).
tff(conjecture1,conjecture,
'top$' = 'fun_app$b'('fun_app$c'('sup$','fun_app$b'('fun_app$c'('minus$','top$'),'fun_app$b'('insert$'('a$'),'bot$'))),'fun_app$b'('insert$'('a$'),'bot$')),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture1) ).
tff(axiom46,axiom,
! [X1: 'B_set$',X59: 'B_set$'] : ( 'fun_app$b'('fun_app$c'('sup$',X1),X59) = 'fun_app$b'('fun_app$c'('sup$',X59),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom46) ).
tff(axiom564,axiom,
! [X1: 'B_set$'] : ( 'fun_app$b'('uminus$',X1) = 'fun_app$b'('fun_app$c'('minus$','top$'),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom564) ).
tff(axiom403,axiom,
! [X1: 'B_set$'] : ( 'fun_app$b'('fun_app$c'('sup$',X1),'fun_app$b'('uminus$',X1)) = 'top$' ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom403) ).
tff(c_0_4,negated_conjecture,
'top$' != 'fun_app$b'('fun_app$c'('sup$','fun_app$b'('fun_app$c'('minus$','top$'),'fun_app$b'('insert$'('a$'),'bot$'))),'fun_app$b'('insert$'('a$'),'bot$')),
inference(assume_negation,[status(cth)],[conjecture1]) ).
tff(c_0_5,negated_conjecture,
'top$' != 'fun_app$b'('fun_app$c'('sup$','fun_app$b'('fun_app$c'('minus$','top$'),'fun_app$b'('insert$'('a$'),'bot$'))),'fun_app$b'('insert$'('a$'),'bot$')),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
tff(c_0_6,negated_conjecture,
'top$' != 'fun_app$b'('fun_app$c'('sup$','fun_app$b'('fun_app$c'('minus$','top$'),'fun_app$b'('insert$'('a$'),'bot$'))),'fun_app$b'('insert$'('a$'),'bot$')),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tff(c_0_7,plain,
! [X1116: 'B_set$',X1117: 'B_set$'] : ( 'fun_app$b'('fun_app$c'('sup$',X1116),X1117) = 'fun_app$b'('fun_app$c'('sup$',X1117),X1116) ),
inference(variable_rename,[status(thm)],[axiom46]) ).
tff(c_0_8,plain,
! [X2417: 'B_set$'] : ( 'fun_app$b'('uminus$',X2417) = 'fun_app$b'('fun_app$c'('minus$','top$'),X2417) ),
inference(variable_rename,[status(thm)],[axiom564]) ).
tff(c_0_9,plain,
! [X1987: 'B_set$'] : ( 'fun_app$b'('fun_app$c'('sup$',X1987),'fun_app$b'('uminus$',X1987)) = 'top$' ),
inference(variable_rename,[status(thm)],[axiom403]) ).
tcf(c_0_10,negated_conjecture,
'top$' != 'fun_app$b'('fun_app$c'('sup$','fun_app$b'('fun_app$c'('minus$','top$'),'fun_app$b'('insert$'('a$'),'bot$'))),'fun_app$b'('insert$'('a$'),'bot$')),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
! [X4: 'B_set$',X1: 'B_set$'] : 'fun_app$b'('fun_app$c'('sup$',X1),X4) = 'fun_app$b'('fun_app$c'('sup$',X4),X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
! [X1: 'B_set$'] : 'fun_app$b'('uminus$',X1) = 'fun_app$b'('fun_app$c'('minus$','top$'),X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X1: 'B_set$'] : 'fun_app$b'('fun_app$c'('sup$',X1),'fun_app$b'('uminus$',X1)) = 'top$',
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP322_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.57 % Computer : n026.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Sun Sep 20 22:36:52 UTC 2026
% 0.11/0.57 % CPUTime :
% 0.11/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.62 Running first-order theorem proving
% 0.11/0.62 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.14/0.76 % Version: 3.5.1
% 0.14/0.76 % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.14/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.76 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.14/0.76 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.76 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.76 % Starting sh5l with 300s (1) cores
% 0.14/0.76 % G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 737705 completed with status 0
% 0.14/0.76 % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 0.14/0.76 % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.14/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.76 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.14/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.76 % No SInE strategy applied
% 0.14/0.76 % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.14/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.76 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.76 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.14/0.76 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.76 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.14/0.76 % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.76 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 737715 completed with status 0
% 0.14/0.76 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 0.14/0.76 % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.14/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.76 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.14/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.76 % No SInE strategy applied
% 0.14/0.76 % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.14/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.76 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.76 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.14/0.76 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.76 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.14/0.76 % Preprocessing time : 0.015 s
% 0.14/0.76 % Presaturation interreduction done
% 0.14/0.76
% 0.14/0.76 % Proof found!
% 0.14/0.76 % SZS status Theorem
% 0.14/0.76 % SZS output start CNFRefutation
% See solution above
% 0.14/0.76 % Parsed axioms : 793
% 0.14/0.76 % Removed by relevancy pruning/SinE : 0
% 0.14/0.76 % Initial clauses : 1321
% 0.14/0.76 % Removed in clause preprocessing : 214
% 0.14/0.76 % Initial clauses in saturation : 1107
% 0.14/0.76 % Processed clauses : 310
% 0.14/0.76 % ...of these trivial : 38
% 0.14/0.76 % ...subsumed : 60
% 0.14/0.76 % ...remaining for further processing : 212
% 0.14/0.76 % Other redundant clauses eliminated : 53
% 0.14/0.76 % Clauses deleted for lack of memory : 0
% 0.14/0.76 % Backward-subsumed : 10
% 0.14/0.76 % Backward-rewritten : 17
% 0.14/0.76 % Generated clauses : 43
% 0.14/0.76 % ...of the previous two non-redundant : 44
% 0.14/0.76 % ...aggressively subsumed : 0
% 0.14/0.76 % Contextual simplify-reflections : 0
% 0.14/0.76 % Paramodulations : 0
% 0.14/0.76 % Factorizations : 0
% 0.14/0.76 % NegExts : 0
% 0.14/0.76 % Equation resolutions : 53
% 0.14/0.76 % Disequality decompositions : 0
% 0.14/0.76 % Total rewrite steps : 85
% 0.14/0.76 % ...of those cached : 43
% 0.14/0.76 % Propositional unsat checks : 0
% 0.14/0.76 % Propositional check models : 0
% 0.14/0.76 % Propositional check unsatisfiable : 0
% 0.14/0.76 % Propositional clauses : 0
% 0.14/0.76 % Propositional clauses after purity: 0
% 0.14/0.76 % Propositional unsat core size : 0
% 0.14/0.76 % Propositional preprocessing time : 0.000
% 0.14/0.76 % Propositional encoding time : 0.000
% 0.14/0.76 % Propositional solver time : 0.000
% 0.14/0.76 % Success case prop preproc time : 0.000
% 0.14/0.76 % Success case prop encoding time : 0.000
% 0.14/0.76 % Success case prop solver time : 0.000
% 0.14/0.76 % Current number of processed clauses : 142
% 0.14/0.76 % Positive orientable unit clauses : 61
% 0.14/0.76 % Positive unorientable unit clauses: 1
% 0.14/0.76 % Negative unit clauses : 11
% 0.14/0.76 % Non-unit-clauses : 69
% 0.14/0.76 % Current number of unprocessed clauses: 841
% 0.14/0.76 % ...number of literals in the above : 2064
% 0.14/0.76 % Current number of archived formulas : 0
% 0.14/0.76 % Current number of archived clauses : 27
% 0.14/0.76 % Clause-clause subsumption calls (NU) : 1791
% 0.14/0.76 % Rec. Clause-clause subsumption calls : 1673
% 0.14/0.76 % Non-unit clause-clause subsumptions : 30
% 0.14/0.76 % Unit Clause-clause subsumption calls : 106
% 0.14/0.76 % Rewrite failures with RHS unbound : 0
% 0.14/0.76 % BW rewrite match attempts : 46
% 0.14/0.76 % BW rewrite match successes : 27
% 0.14/0.76 % Condensation attempts : 0
% 0.14/0.76 % Condensation successes : 0
% 0.14/0.76 % Termbank termtop insertions : 84709
% 0.14/0.76 % Search garbage collected termcells : 15220
% 0.14/0.76
% 0.14/0.76 % -------------------------------------------------
% 0.14/0.76 % User time : 0.071 s
% 0.14/0.76 % System time : 0.020 s
% 0.14/0.76 % Total time : 0.091 s
% 0.14/0.76 % Maximum resident set size: 8308 pages
% 0.14/0.76
% 0.14/0.76 % -------------------------------------------------
% 0.14/0.76 % User time : 0.186 s
% 0.14/0.76 % System time : 0.055 s
% 0.14/0.76 % Total time : 0.241 s
% 0.14/0.76 % Maximum resident set size: 6144 pages
% 0.14/0.76 % E exiting
%------------------------------------------------------------------------------