%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP399_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 : n013.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:31 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_c_prod_b_complement_domain_ell2_a_c_prod_b_complement_domain_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort2,type,
'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort3,type,
'A_c_prod_ell2_a_c_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort4,type,
'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort5,type,
'A_a_c_prod_b_complement_domain_prod_ell2_a_a_c_prod_b_complement_domain_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_57,type,
'complements$': ( 'A_a_c_prod_b_complement_domain_prod_ell2_a_a_c_prod_b_complement_domain_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > $o ).
tff(decl_195,type,
'f$': 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_259,type,
'g$': 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_311,type,
'compatible$': ( 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > $o ).
tff(decl_621,type,
'register_pair$': ( 'A_c_prod_b_complement_domain_ell2_a_c_prod_b_complement_domain_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > 'A_a_c_prod_b_complement_domain_prod_ell2_a_a_c_prod_b_complement_domain_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_658,type,
'register_pair$a': ( 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > 'A_c_prod_ell2_a_c_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_722,type,
'complement$': 'A_c_prod_ell2_a_c_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' > 'A_c_prod_b_complement_domain_ell2_a_c_prod_b_complement_domain_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(conjecture0,conjecture,
'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture0) ).
tff(axiom18,axiom,
! [X26: 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$',X2: 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$'] :
( 'compatible$'(X26,X2)
=> 'complements$'(X2,'register_pair$'(X26,'complement$'('register_pair$a'(X26,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom18) ).
tff(axiom3,axiom,
'compatible$'('f$','g$'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom3) ).
tff(c_0_3,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(assume_negation,[status(cth)],[conjecture0]) ).
tff(c_0_4,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_5,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tff(c_0_6,plain,
! [X1436: 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$',X1437: 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$'] :
( 'complements$'(X1437,'register_pair$'(X1436,'complement$'('register_pair$a'(X1436,X1437))))
| ~ 'compatible$'(X1436,X1437) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom18])])]) ).
tcf(c_0_7,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,plain,
! [X4: 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$',X2: 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$'] :
( ~ 'compatible$'(X4,X2)
| 'complements$'(X2,'register_pair$'(X4,'complement$'('register_pair$a'(X4,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_9,plain,
'compatible$'('f$','g$'),
inference(split_conjunct,[status(thm)],[axiom3]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP399_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.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:36:51 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 0.17/0.46 % Version: 3.5.1
% 0.17/0.46 % partial match(1): FMLMSMSMSSSNFFN
% 0.17/0.46 % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.17/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 % Starting sh5l with 300s (1) cores
% 0.17/0.46 % new_bool_1 with pid 3557725 completed with status 0
% 0.17/0.46 % Result found by new_bool_1
% 0.17/0.46 % partial match(1): FMLMSMSMSSSNFFN
% 0.17/0.46 % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.17/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.46 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.46 % SubtermCWHack with pid 3557727 completed with status 0
% 0.17/0.46 % Result found by SubtermCWHack
% 0.17/0.46 % partial match(1): FMLMSMSMSSSNFFN
% 0.17/0.46 % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.17/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.46 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.46 % Preprocessing time : 0.004 s
% 0.17/0.46
% 0.17/0.46 % Proof found!
% 0.17/0.46 % SZS status Theorem
% 0.17/0.46 % SZS output start CNFRefutation
% See solution above
% 0.17/0.46 % Parsed axioms : 1679
% 0.17/0.46 % Removed by relevancy pruning/SinE : 1648
% 0.17/0.46 % Initial clauses : 46
% 0.17/0.46 % Removed in clause preprocessing : 2
% 0.17/0.46 % Initial clauses in saturation : 44
% 0.17/0.46 % Processed clauses : 43
% 0.17/0.46 % ...of these trivial : 0
% 0.17/0.46 % ...subsumed : 5
% 0.17/0.46 % ...remaining for further processing : 38
% 0.17/0.46 % Other redundant clauses eliminated : 2
% 0.17/0.46 % Clauses deleted for lack of memory : 0
% 0.17/0.46 % Backward-subsumed : 0
% 0.17/0.46 % Backward-rewritten : 2
% 0.17/0.46 % Generated clauses : 13
% 0.17/0.46 % ...of the previous two non-redundant : 6
% 0.17/0.46 % ...aggressively subsumed : 0
% 0.17/0.46 % Contextual simplify-reflections : 0
% 0.17/0.46 % Paramodulations : 11
% 0.17/0.46 % Factorizations : 0
% 0.17/0.46 % NegExts : 0
% 0.17/0.46 % Equation resolutions : 2
% 0.17/0.46 % Disequality decompositions : 0
% 0.17/0.46 % Total rewrite steps : 10
% 0.17/0.46 % ...of those cached : 3
% 0.17/0.46 % Propositional unsat checks : 0
% 0.17/0.46 % Propositional check models : 0
% 0.17/0.46 % Propositional check unsatisfiable : 0
% 0.17/0.46 % Propositional clauses : 0
% 0.17/0.46 % Propositional clauses after purity: 0
% 0.17/0.46 % Propositional unsat core size : 0
% 0.17/0.46 % Propositional preprocessing time : 0.000
% 0.17/0.46 % Propositional encoding time : 0.000
% 0.17/0.46 % Propositional solver time : 0.000
% 0.17/0.46 % Success case prop preproc time : 0.000
% 0.17/0.46 % Success case prop encoding time : 0.000
% 0.17/0.46 % Success case prop solver time : 0.000
% 0.17/0.46 % Current number of processed clauses : 34
% 0.17/0.46 % Positive orientable unit clauses : 12
% 0.17/0.46 % Positive unorientable unit clauses: 0
% 0.17/0.46 % Negative unit clauses : 1
% 0.17/0.46 % Non-unit-clauses : 21
% 0.17/0.46 % Current number of unprocessed clauses: 7
% 0.17/0.46 % ...number of literals in the above : 22
% 0.17/0.46 % Current number of archived formulas : 0
% 0.17/0.46 % Current number of archived clauses : 2
% 0.17/0.46 % Clause-clause subsumption calls (NU) : 83
% 0.17/0.46 % Rec. Clause-clause subsumption calls : 68
% 0.17/0.46 % Non-unit clause-clause subsumptions : 5
% 0.17/0.46 % Unit Clause-clause subsumption calls : 2
% 0.17/0.46 % Rewrite failures with RHS unbound : 0
% 0.17/0.46 % BW rewrite match attempts : 1
% 0.17/0.46 % BW rewrite match successes : 1
% 0.17/0.46 % Condensation attempts : 0
% 0.17/0.46 % Condensation successes : 0
% 0.17/0.46 % Termbank termtop insertions : 11914
% 0.17/0.46 % Search garbage collected termcells : 7498
% 0.17/0.46
% 0.17/0.46 % -------------------------------------------------
% 0.17/0.46 % User time : 0.011 s
% 0.17/0.46 % System time : 0.013 s
% 0.17/0.46 % Total time : 0.023 s
% 0.17/0.46 % Maximum resident set size: 7240 pages
% 0.17/0.46
% 0.17/0.46 % -------------------------------------------------
% 0.17/0.46 % User time : 0.037 s
% 0.17/0.46 % System time : 0.018 s
% 0.17/0.46 % Total time : 0.055 s
% 0.17/0.46 % Maximum resident set size: 6912 pages
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------