%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW473^1 : 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 : 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:09 AM UTC 2026
% Result : Theorem 0.22s 0.34s
% 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/sandbox/tmp/tmp.12VEVEfgm7/E---3.1_2680055.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/sandbox/tmp/tmp.12VEVEfgm7/E---3.1_2680055.p',fact_274_insert__subset) ).
thf(conj_1,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox/tmp/tmp.12VEVEfgm7/E---3.1_2680055.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/sandbox/tmp/tmp.12VEVEfgm7/E---3.1_2680055.p',fact_261_imageI) ).
thf(conj_4,hypothesis,
member_pname @ pn @ u,
file('/export/starexec/sandbox/tmp/tmp.12VEVEfgm7/E---3.1_2680055.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,
! [X1127: x_a,X1128: x_a > $o,X1129: x_a > $o] :
( ( ( member_a @ X1127 @ X1129 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X1127 @ X1128 ) @ X1129 ) )
& ( ( ord_less_eq_a_o @ X1128 @ X1129 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X1127 @ X1128 ) @ X1129 ) )
& ( ~ ( member_a @ X1127 @ X1129 )
| ~ ( ord_less_eq_a_o @ X1128 @ X1129 )
| ( ord_less_eq_a_o @ ( insert_a @ X1127 @ X1128 ) @ X1129 ) ) ),
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,
! [X1173: pname > x_a,X1174: pname,X1175: pname > $o] :
( ~ ( member_pname @ X1174 @ X1175 )
| ( member_a @ ( X1173 @ X1174 ) @ ( image_pname_a @ X1173 @ X1175 ) ) ),
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.02 % Problem : SWW473^1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n003.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 16:07:43 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.22/0.27 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.12VEVEfgm7/E---3.1_2680055.p
% 0.22/0.34 % Version: 3.5.1-ho
% 0.22/0.34 % Preprocessing class: HSLMSMSSSSLCHSA.
% 0.22/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.34 % Starting pre_casc_6 with 1500s (5) cores
% 0.22/0.34 % Starting ehoh_best7 with 300s (1) cores
% 0.22/0.34 % Starting new_bool_8 with 300s (1) cores
% 0.22/0.34 % Starting new_ho_11 with 300s (1) cores
% 0.22/0.34 % pre_casc_6 with pid 2680101 completed with status 0
% 0.22/0.34 % Result found by pre_casc_6
% 0.22/0.34 % Preprocessing class: HSLMSMSSSSLCHSA.
% 0.22/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.34 % Starting pre_casc_6 with 1500s (5) cores
% 0.22/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,3,,5,20000,1.0,true))
% 0.22/0.34 % SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.22/0.34 % Search class: HGHSM-FSLS32-MHSFFSBN
% 0.22/0.34 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.34 % Starting SubtermCWHack with 151s (1) cores
% 0.22/0.34 % Starting new_ho_9 with 975s (1) cores
% 0.22/0.34 % Starting new_ho_4 with 151s (1) cores
% 0.22/0.34 % Starting pre_casc_6 with 151s (1) cores
% 0.22/0.34 % Starting additional_ho_6 with 72s (1) cores
% 0.22/0.34 % new_ho_9 with pid 2680114 completed with status 0
% 0.22/0.34 % Result found by new_ho_9
% 0.22/0.34 % Preprocessing class: HSLMSMSSSSLCHSA.
% 0.22/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.34 % Starting pre_casc_6 with 1500s (5) cores
% 0.22/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,3,,5,20000,1.0,true))
% 0.22/0.34 % SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.22/0.34 % Search class: HGHSM-FSLS32-MHSFFSBN
% 0.22/0.34 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.34 % Starting SubtermCWHack with 151s (1) cores
% 0.22/0.34 % Starting new_ho_9 with 975s (1) cores
% 0.22/0.34 % Preprocessing time : 0.003 s
% 0.22/0.34 % Presaturation interreduction done
% 0.22/0.34
% 0.22/0.34 % Proof found!
% 0.22/0.34 % SZS status Theorem
% 0.22/0.34 % SZS output start CNFRefutation
% See solution above
% 0.22/0.34 % Parsed axioms : 414
% 0.22/0.34 % Removed by relevancy pruning/SinE : 229
% 0.22/0.34 % Initial clauses : 287
% 0.22/0.34 % Removed in clause preprocessing : 5
% 0.22/0.34 % Initial clauses in saturation : 282
% 0.22/0.34 % Processed clauses : 525
% 0.22/0.34 % ...of these trivial : 7
% 0.22/0.34 % ...subsumed : 71
% 0.22/0.34 % ...remaining for further processing : 447
% 0.22/0.34 % Other redundant clauses eliminated : 39
% 0.22/0.34 % Clauses deleted for lack of memory : 0
% 0.22/0.34 % Backward-subsumed : 2
% 0.22/0.34 % Backward-rewritten : 0
% 0.22/0.34 % Generated clauses : 733
% 0.22/0.34 % ...of the previous two non-redundant : 539
% 0.22/0.34 % ...aggressively subsumed : 0
% 0.22/0.34 % Contextual simplify-reflections : 0
% 0.22/0.34 % Paramodulations : 663
% 0.22/0.34 % Factorizations : 2
% 0.22/0.34 % NegExts : 0
% 0.22/0.34 % Equation resolutions : 40
% 0.22/0.34 % Disequality decompositions : 0
% 0.22/0.34 % Total rewrite steps : 161
% 0.22/0.34 % ...of those cached : 97
% 0.22/0.34 % Propositional unsat checks : 0
% 0.22/0.34 % Propositional check models : 0
% 0.22/0.34 % Propositional check unsatisfiable : 0
% 0.22/0.34 % Propositional clauses : 0
% 0.22/0.34 % Propositional clauses after purity: 0
% 0.22/0.34 % Propositional unsat core size : 0
% 0.22/0.34 % Propositional preprocessing time : 0.000
% 0.22/0.34 % Propositional encoding time : 0.000
% 0.22/0.34 % Propositional solver time : 0.000
% 0.22/0.34 % Success case prop preproc time : 0.000
% 0.22/0.34 % Success case prop encoding time : 0.000
% 0.22/0.34 % Success case prop solver time : 0.000
% 0.22/0.34 % Current number of processed clauses : 198
% 0.22/0.34 % Positive orientable unit clauses : 46
% 0.22/0.34 % Positive unorientable unit clauses: 4
% 0.22/0.34 % Negative unit clauses : 19
% 0.22/0.34 % Non-unit-clauses : 129
% 0.22/0.34 % Current number of unprocessed clauses: 504
% 0.22/0.34 % ...number of literals in the above : 1104
% 0.22/0.34 % Current number of archived formulas : 0
% 0.22/0.34 % Current number of archived clauses : 212
% 0.22/0.34 % Clause-clause subsumption calls (NU) : 6822
% 0.22/0.34 % Rec. Clause-clause subsumption calls : 6471
% 0.22/0.34 % Non-unit clause-clause subsumptions : 49
% 0.22/0.34 % Unit Clause-clause subsumption calls : 325
% 0.22/0.34 % Rewrite failures with RHS unbound : 0
% 0.22/0.34 % BW rewrite match attempts : 51
% 0.22/0.34 % BW rewrite match successes : 18
% 0.22/0.34 % Condensation attempts : 525
% 0.22/0.34 % Condensation successes : 0
% 0.22/0.34 % Termbank termtop insertions : 31705
% 0.22/0.34 % Search garbage collected termcells : 7062
% 0.22/0.34
% 0.22/0.34 % -------------------------------------------------
% 0.22/0.34 % User time : 0.041 s
% 0.22/0.34 % System time : 0.008 s
% 0.22/0.34 % Total time : 0.049 s
% 0.22/0.34 % Maximum resident set size: 5572 pages
% 0.22/0.34
% 0.22/0.34 % -------------------------------------------------
% 0.22/0.34 % User time : 0.124 s
% 0.22/0.34 % System time : 0.029 s
% 0.22/0.34 % Total time : 0.154 s
% 0.22/0.34 % Maximum resident set size: 5632 pages
% 0.22/0.34 % E exiting
%------------------------------------------------------------------------------