%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWW473^1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:11 AM UTC 2026
% Result : Theorem 0.22s 0.37s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 68 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 135 ( 13 ~; 8 |; 3 &; 109 @)
% ( 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,
x_a: $tType ).
thf(decl_sort2,type,
pname: $tType ).
thf(decl_52,type,
ord_less_eq_a_o: ( x_a > $o ) > ( x_a > $o ) > $o ).
thf(decl_95,type,
image_pname_a: ( pname > x_a ) > ( pname > $o ) > x_a > $o ).
thf(decl_112,type,
insert_a: x_a > ( x_a > $o ) > x_a > $o ).
thf(decl_118,type,
member_a: x_a > ( x_a > $o ) > $o ).
thf(decl_119,type,
member_pname: pname > ( pname > $o ) > $o ).
thf(decl_121,type,
g: x_a > $o ).
thf(decl_123,type,
u: pname > $o ).
thf(decl_124,type,
mgt_call: pname > x_a ).
thf(decl_126,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/sandbox2/tmp/tmp.2liWfT43TG/E---3.1_2680165.p',conj_6) ).
thf(fact_274_insert__subset,axiom,
! [X557: x_a,X558: x_a > $o,X559: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X557 @ X558 ) @ X559 )
<=> ( ( member_a @ X557 @ X559 )
& ( ord_less_eq_a_o @ X558 @ X559 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2liWfT43TG/E---3.1_2680165.p',fact_274_insert__subset) ).
thf(conj_1,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox2/tmp/tmp.2liWfT43TG/E---3.1_2680165.p',conj_1) ).
thf(fact_261_imageI,axiom,
! [X521: pname > x_a,X522: pname,X523: pname > $o] :
( ( member_pname @ X522 @ X523 )
=> ( member_a @ ( X521 @ X522 ) @ ( image_pname_a @ X521 @ X523 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2liWfT43TG/E---3.1_2680165.p',fact_261_imageI) ).
thf(conj_4,hypothesis,
member_pname @ pn @ u,
file('/export/starexec/sandbox2/tmp/tmp.2liWfT43TG/E---3.1_2680165.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,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
! [X1108: x_a,X1109: x_a > $o,X1110: x_a > $o] :
( ( ( member_a @ X1108 @ X1110 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X1108 @ X1109 ) @ X1110 ) )
& ( ( ord_less_eq_a_o @ X1109 @ X1110 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X1108 @ X1109 ) @ X1110 ) )
& ( ~ ( member_a @ X1108 @ X1110 )
| ~ ( ord_less_eq_a_o @ X1109 @ X1110 )
| ( ord_less_eq_a_o @ ( insert_a @ X1108 @ X1109 ) @ X1110 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_274_insert__subset])])])]) ).
thf(c_0_9,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_7]) ).
thf(c_0_10,plain,
! [X83: x_a,X2: x_a > $o,X1: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X83 @ X2 ) @ X1 )
| ~ ( member_a @ X83 @ X1 )
| ~ ( ord_less_eq_a_o @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
inference(split_conjunct,[status(thm)],[conj_1]) ).
thf(c_0_12,plain,
! [X961: pname > x_a,X962: pname,X963: pname > $o] :
( ~ ( member_pname @ X962 @ X963 )
| ( member_a @ ( X961 @ X962 ) @ ( image_pname_a @ X961 @ X963 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_261_imageI])])]) ).
thf(c_0_13,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_9,c_0_10]),c_0_11])]) ).
thf(c_0_14,plain,
! [X87: pname,X21: pname > x_a,X5: pname > $o] :
( ( member_a @ ( X21 @ X87 ) @ ( image_pname_a @ X21 @ X5 ) )
| ~ ( member_pname @ X87 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,hypothesis,
member_pname @ pn @ u,
inference(split_conjunct,[status(thm)],[conj_4]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW473^1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n003.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:07:44 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.22/0.29 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.2liWfT43TG/E---3.1_2680165.p
% 0.22/0.37 % Version: 3.5.1-ho
% 0.22/0.37 % Preprocessing class: HSLMSMSSSSLCHSA.
% 0.22/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.37 % Starting pre_casc_6 with 1500s (5) cores
% 0.22/0.37 % Starting ehoh_best7 with 300s (1) cores
% 0.22/0.37 % Starting new_bool_8 with 300s (1) cores
% 0.22/0.37 % Starting new_ho_11 with 300s (1) cores
% 0.22/0.37 % new_bool_8 with pid 2680217 completed with status 0
% 0.22/0.37 % Result found by new_bool_8
% 0.22/0.37 % Preprocessing class: HSLMSMSSSSLCHSA.
% 0.22/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.37 % Starting pre_casc_6 with 1500s (5) cores
% 0.22/0.37 % Starting ehoh_best7 with 300s (1) cores
% 0.22/0.37 % Starting new_bool_8 with 300s (1) cores
% 0.22/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.22/0.37 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.37 % Search class: HGHSM-FFMS32-MHSFFFBN
% 0.22/0.37 % partial match(2): HGHSM-FSLS32-MHSFFFBN
% 0.22/0.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.37 % SubtermCWHack with pid 2680229 completed with status 0
% 0.22/0.37 % Result found by SubtermCWHack
% 0.22/0.37 % Preprocessing class: HSLMSMSSSSLCHSA.
% 0.22/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.37 % Starting pre_casc_6 with 1500s (5) cores
% 0.22/0.37 % Starting ehoh_best7 with 300s (1) cores
% 0.22/0.37 % Starting new_bool_8 with 300s (1) cores
% 0.22/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.22/0.37 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.37 % Search class: HGHSM-FFMS32-MHSFFFBN
% 0.22/0.37 % partial match(2): HGHSM-FSLS32-MHSFFFBN
% 0.22/0.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.37 % Preprocessing time : 0.004 s
% 0.22/0.37
% 0.22/0.37 % Proof found!
% 0.22/0.37 % SZS status Theorem
% 0.22/0.37 % SZS output start CNFRefutation
% See solution above
% 0.22/0.37 % Parsed axioms : 414
% 0.22/0.37 % Removed by relevancy pruning/SinE : 290
% 0.22/0.37 % Initial clauses : 171
% 0.22/0.37 % Removed in clause preprocessing : 4
% 0.22/0.37 % Initial clauses in saturation : 167
% 0.22/0.37 % Processed clauses : 453
% 0.22/0.37 % ...of these trivial : 24
% 0.22/0.37 % ...subsumed : 204
% 0.22/0.37 % ...remaining for further processing : 225
% 0.22/0.37 % Other redundant clauses eliminated : 22
% 0.22/0.37 % Clauses deleted for lack of memory : 0
% 0.22/0.37 % Backward-subsumed : 0
% 0.22/0.37 % Backward-rewritten : 1
% 0.22/0.37 % Generated clauses : 1542
% 0.22/0.37 % ...of the previous two non-redundant : 1183
% 0.22/0.37 % ...aggressively subsumed : 0
% 0.22/0.37 % Contextual simplify-reflections : 0
% 0.22/0.37 % Paramodulations : 1489
% 0.22/0.37 % Factorizations : 10
% 0.22/0.37 % NegExts : 0
% 0.22/0.37 % Equation resolutions : 25
% 0.22/0.37 % Disequality decompositions : 0
% 0.22/0.37 % Total rewrite steps : 330
% 0.22/0.37 % ...of those cached : 218
% 0.22/0.37 % Propositional unsat checks : 0
% 0.22/0.37 % Propositional check models : 0
% 0.22/0.37 % Propositional check unsatisfiable : 0
% 0.22/0.37 % Propositional clauses : 0
% 0.22/0.37 % Propositional clauses after purity: 0
% 0.22/0.37 % Propositional unsat core size : 0
% 0.22/0.37 % Propositional preprocessing time : 0.000
% 0.22/0.37 % Propositional encoding time : 0.000
% 0.22/0.37 % Propositional solver time : 0.000
% 0.22/0.37 % Success case prop preproc time : 0.000
% 0.22/0.37 % Success case prop encoding time : 0.000
% 0.22/0.37 % Success case prop solver time : 0.000
% 0.22/0.37 % Current number of processed clauses : 202
% 0.22/0.37 % Positive orientable unit clauses : 58
% 0.22/0.37 % Positive unorientable unit clauses: 3
% 0.22/0.37 % Negative unit clauses : 16
% 0.22/0.37 % Non-unit-clauses : 125
% 0.22/0.37 % Current number of unprocessed clauses: 896
% 0.22/0.37 % ...number of literals in the above : 2043
% 0.22/0.37 % Current number of archived formulas : 0
% 0.22/0.37 % Current number of archived clauses : 4
% 0.22/0.37 % Clause-clause subsumption calls (NU) : 2189
% 0.22/0.37 % Rec. Clause-clause subsumption calls : 2168
% 0.22/0.37 % Non-unit clause-clause subsumptions : 162
% 0.22/0.37 % Unit Clause-clause subsumption calls : 8
% 0.22/0.37 % Rewrite failures with RHS unbound : 0
% 0.22/0.37 % BW rewrite match attempts : 81
% 0.22/0.37 % BW rewrite match successes : 29
% 0.22/0.37 % Condensation attempts : 0
% 0.22/0.37 % Condensation successes : 0
% 0.22/0.37 % Termbank termtop insertions : 28720
% 0.22/0.37 % Search garbage collected termcells : 5345
% 0.22/0.37
% 0.22/0.37 % -------------------------------------------------
% 0.22/0.37 % User time : 0.045 s
% 0.22/0.37 % System time : 0.008 s
% 0.22/0.37 % Total time : 0.052 s
% 0.22/0.37 % Maximum resident set size: 5316 pages
% 0.22/0.37
% 0.22/0.37 % -------------------------------------------------
% 0.22/0.37 % User time : 0.058 s
% 0.22/0.37 % System time : 0.012 s
% 0.22/0.37 % Total time : 0.070 s
% 0.22/0.37 % Maximum resident set size: 5632 pages
% 0.22/0.37 % E exiting
%------------------------------------------------------------------------------