%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW473^3 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 : Wed Sep 30 08:40:09 AM UTC 2026
% Result : Theorem 0.48s 0.43s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 127 ( 12 ~; 8 |; 3 &; 102 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pname: $tType ).
thf(decl_sort2,type,
x_a: $tType ).
thf(decl_98,type,
ord_less_eq_a_o: ( x_a > $o ) > ( x_a > $o ) > $o ).
thf(decl_145,type,
image_pname_a: ( pname > x_a ) > ( pname > $o ) > x_a > $o ).
thf(decl_166,type,
insert_a: x_a > ( x_a > $o ) > x_a > $o ).
thf(decl_180,type,
member_a: x_a > ( x_a > $o ) > $o ).
thf(decl_181,type,
member_pname: pname > ( pname > $o ) > $o ).
thf(decl_184,type,
g: x_a > $o ).
thf(decl_186,type,
u: pname > $o ).
thf(decl_188,type,
mgt_call: pname > x_a ).
thf(decl_190,type,
pn: pname ).
thf(conj_6,conjecture,
ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox/tmp/tmp.u2GdLUUHqW/E---3.1_296787.p',conj_6) ).
thf(fact_453_insert__subset,axiom,
! [X1075: x_a,X1076: x_a > $o,X1077: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X1075 @ X1076 ) @ X1077 )
<=> ( ( member_a @ X1075 @ X1077 )
& ( ord_less_eq_a_o @ X1076 @ X1077 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.u2GdLUUHqW/E---3.1_296787.p',fact_453_insert__subset) ).
thf(conj_1,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox/tmp/tmp.u2GdLUUHqW/E---3.1_296787.p',conj_1) ).
thf(fact_434_imageI,axiom,
! [X1021: pname > x_a,X1022: pname,X1023: pname > $o] :
( ( member_pname @ X1022 @ X1023 )
=> ( member_a @ ( X1021 @ X1022 ) @ ( image_pname_a @ X1021 @ X1023 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.u2GdLUUHqW/E---3.1_296787.p',fact_434_imageI) ).
thf(conj_4,hypothesis,
member_pname @ pn @ u,
file('/export/starexec/sandbox/tmp/tmp.u2GdLUUHqW/E---3.1_296787.p',conj_4) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(assume_negation,[status(cth)],[conj_6]) ).
thf(c_0_6,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X3424: x_a,X3425: x_a > $o,X3426: x_a > $o] :
( ( ( member_a @ X3424 @ X3426 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X3424 @ X3425 ) @ X3426 ) )
& ( ( ord_less_eq_a_o @ X3425 @ X3426 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X3424 @ X3425 ) @ X3426 ) )
& ( ~ ( member_a @ X3424 @ X3426 )
| ~ ( ord_less_eq_a_o @ X3425 @ X3426 )
| ( ord_less_eq_a_o @ ( insert_a @ X3424 @ X3425 ) @ X3426 ) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_453_insert__subset])])]) ).
thf(c_0_8,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X91: x_a,X2: x_a > $o,X1: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X91 @ X2 ) @ X1 )
| ~ ( member_a @ X91 @ X1 )
| ~ ( ord_less_eq_a_o @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
inference(split_conjunct,[status(thm)],[conj_1]) ).
thf(c_0_11,plain,
! [X3474: pname > x_a,X3475: pname,X3476: pname > $o] :
( ~ ( member_pname @ X3475 @ X3476 )
| ( member_a @ ( X3474 @ X3475 ) @ ( image_pname_a @ X3474 @ X3476 ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_434_imageI])]) ).
thf(c_0_12,negated_conjecture,
~ ( member_a @ ( mgt_call @ pn ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
thf(c_0_13,plain,
! [X85: pname,X74: pname > x_a,X13: pname > $o] :
( ( member_a @ ( X74 @ X85 ) @ ( image_pname_a @ X74 @ X13 ) )
| ~ ( member_pname @ X85 @ X13 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,hypothesis,
member_pname @ pn @ u,
inference(split_conjunct,[status(thm)],[conj_4]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWW473^3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 16:05:33 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.14 Running higher-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.u2GdLUUHqW/E---3.1_296787.p
% 0.48/0.43 % Version: 3.5.1-ho
% 0.48/0.43 % Preprocessing class: HMLMSMSMSSLCHSA.
% 0.48/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.43 % Starting new_ho_10 with 1500s (5) cores
% 0.48/0.43 % Starting sh5l with 300s (1) cores
% 0.48/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.43 % Starting new_bool_2 with 300s (1) cores
% 0.48/0.43 % new_bool_2 with pid 296803 completed with status 0
% 0.48/0.43 % Result found by new_bool_2
% 0.48/0.43 % Preprocessing class: HMLMSMSMSSLCHSA.
% 0.48/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.43 % Starting new_ho_10 with 1500s (5) cores
% 0.48/0.43 % Starting sh5l with 300s (1) cores
% 0.48/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.43 % Starting new_bool_2 with 300s (1) cores
% 0.48/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.48/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/0.43 % Search class: HGHSM-FSLM31-MHSFFSBN
% 0.48/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.48/0.43 % SubtermCWHack with pid 296804 completed with status 0
% 0.48/0.43 % Result found by SubtermCWHack
% 0.48/0.43 % Preprocessing class: HMLMSMSMSSLCHSA.
% 0.48/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.43 % Starting new_ho_10 with 1500s (5) cores
% 0.48/0.43 % Starting sh5l with 300s (1) cores
% 0.48/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.43 % Starting new_bool_2 with 300s (1) cores
% 0.48/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.48/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/0.43 % Search class: HGHSM-FSLM31-MHSFFSBN
% 0.48/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.48/0.43 % Preprocessing time : 0.007 s
% 0.48/0.43
% 0.48/0.43 % Proof found!
% 0.48/0.43 % SZS status Theorem
% 0.48/0.43 % SZS output start CNFRefutation
% See solution above
% 0.48/0.43 % Parsed axioms : 1390
% 0.48/0.43 % Removed by relevancy pruning/SinE : 882
% 0.48/0.43 % Initial clauses : 789
% 0.48/0.43 % Removed in clause preprocessing : 39
% 0.48/0.43 % Initial clauses in saturation : 750
% 0.48/0.43 % Processed clauses : 2717
% 0.48/0.43 % ...of these trivial : 225
% 0.48/0.43 % ...subsumed : 1569
% 0.48/0.43 % ...remaining for further processing : 923
% 0.48/0.43 % Other redundant clauses eliminated : 242
% 0.48/0.43 % Clauses deleted for lack of memory : 0
% 0.48/0.43 % Backward-subsumed : 34
% 0.48/0.43 % Backward-rewritten : 90
% 0.48/0.43 % Generated clauses : 9409
% 0.48/0.43 % ...of the previous two non-redundant : 6947
% 0.48/0.43 % ...aggressively subsumed : 0
% 0.48/0.43 % Contextual simplify-reflections : 1
% 0.48/0.43 % Paramodulations : 9067
% 0.48/0.43 % Factorizations : 6
% 0.48/0.43 % NegExts : 0
% 0.48/0.43 % Equation resolutions : 253
% 0.48/0.43 % Disequality decompositions : 0
% 0.48/0.43 % Total rewrite steps : 3696
% 0.48/0.43 % ...of those cached : 3113
% 0.48/0.43 % Propositional unsat checks : 0
% 0.48/0.43 % Propositional check models : 0
% 0.48/0.43 % Propositional check unsatisfiable : 0
% 0.48/0.43 % Propositional clauses : 0
% 0.48/0.43 % Propositional clauses after purity: 0
% 0.48/0.43 % Propositional unsat core size : 0
% 0.48/0.43 % Propositional preprocessing time : 0.000
% 0.48/0.43 % Propositional encoding time : 0.000
% 0.48/0.43 % Propositional solver time : 0.000
% 0.48/0.43 % Success case prop preproc time : 0.000
% 0.48/0.43 % Success case prop encoding time : 0.000
% 0.48/0.43 % Success case prop solver time : 0.000
% 0.48/0.43 % Current number of processed clauses : 700
% 0.48/0.43 % Positive orientable unit clauses : 217
% 0.48/0.43 % Positive unorientable unit clauses: 6
% 0.48/0.43 % Negative unit clauses : 97
% 0.48/0.43 % Non-unit-clauses : 380
% 0.48/0.43 % Current number of unprocessed clauses: 4883
% 0.48/0.43 % ...number of literals in the above : 10688
% 0.48/0.43 % Current number of archived formulas : 0
% 0.48/0.43 % Current number of archived clauses : 138
% 0.48/0.43 % Clause-clause subsumption calls (NU) : 30945
% 0.48/0.43 % Rec. Clause-clause subsumption calls : 25687
% 0.48/0.43 % Non-unit clause-clause subsumptions : 566
% 0.48/0.43 % Unit Clause-clause subsumption calls : 5163
% 0.48/0.43 % Rewrite failures with RHS unbound : 0
% 0.48/0.43 % BW rewrite match attempts : 357
% 0.48/0.43 % BW rewrite match successes : 110
% 0.48/0.43 % Condensation attempts : 0
% 0.48/0.43 % Condensation successes : 0
% 0.48/0.43 % Termbank termtop insertions : 134864
% 0.48/0.43 % Search garbage collected termcells : 19692
% 0.48/0.43
% 0.48/0.43 % -------------------------------------------------
% 0.48/0.43 % User time : 0.149 s
% 0.48/0.43 % System time : 0.012 s
% 0.48/0.43 % Total time : 0.161 s
% 0.48/0.43 % Maximum resident set size: 9200 pages
% 0.48/0.43
% 0.48/0.43 % -------------------------------------------------
% 0.48/0.43 % User time : 0.173 s
% 0.48/0.43 % System time : 0.020 s
% 0.48/0.43 % Total time : 0.193 s
% 0.48/0.43 % Maximum resident set size: 7680 pages
% 0.48/0.43 % E exiting
%------------------------------------------------------------------------------