%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO383^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:42:52 AM UTC 2026
% Result : Theorem 0.11s 0.25s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 87 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 347 ( 57 ~; 40 |; 28 &; 222 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 89 ( 0 ^; 89 !; 0 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cQ_2: $i > $i > $i > $o ).
thf(decl_24,type,
f: $i > $i ).
thf(decl_25,type,
cP_1: $i > $i > $o ).
thf(decl_26,type,
cQ_1: $i > $i > $i > $o ).
thf(decl_27,type,
d: $i ).
thf(decl_28,type,
c: $i ).
thf(decl_29,type,
b: $i ).
thf(decl_30,type,
a: $i ).
thf(cTHM409_1,conjecture,
~ ( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ! [X1: $i] : ( cP_1 @ d @ X1 )
& ! [X1: $i,X2: $i] :
( ~ ( cP_1 @ X1 @ X2 )
| ( cP_1 @ ( f @ X1 ) @ X2 ) )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 )
| ( cQ_2 @ X4 @ X5 @ X6 ) )
& ! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.yUZasYI74k/E---3.1_1547477.p',cTHM409_1) ).
thf(c_0_1,negated_conjecture,
~ ~ ( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ! [X1: $i] : ( cP_1 @ d @ X1 )
& ! [X1: $i,X2: $i] :
( ~ ( cP_1 @ X1 @ X2 )
| ( cP_1 @ ( f @ X1 ) @ X2 ) )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 )
| ( cQ_2 @ X4 @ X5 @ X6 ) )
& ! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ) ),
inference(assume_negation,[status(cth)],[cTHM409_1]) ).
thf(c_0_2,negated_conjecture,
~ ~ ( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ! [X1: $i] : ( cP_1 @ d @ X1 )
& ! [X1: $i,X2: $i] :
( ~ ( cP_1 @ X1 @ X2 )
| ( cP_1 @ ( f @ X1 ) @ X2 ) )
& ! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 )
| ( cQ_2 @ X4 @ X5 @ X6 ) )
& ! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X19: $i,X20: $i,X21: $i,X22: $i,X23: $i,X24: $i,X25: $i,X26: $i,X27: $i,X28: $i,X29: $i,X30: $i] :
( ( cQ_1 @ a @ b @ c )
& ( cP_1 @ a @ a )
& ( cP_1 @ b @ b )
& ( cP_1 @ c @ c )
& ( cP_1 @ d @ X19 )
& ( ~ ( cP_1 @ X20 @ X21 )
| ( cP_1 @ ( f @ X20 ) @ X21 ) )
& ( ~ ( cQ_1 @ X22 @ X23 @ X24 )
| ~ ( cP_1 @ ( f @ X22 ) @ X25 )
| ~ ( cP_1 @ ( f @ X23 ) @ X26 )
| ~ ( cP_1 @ ( f @ X24 ) @ X27 )
| ( cQ_2 @ X25 @ X26 @ X27 ) )
& ~ ( cQ_2 @ X28 @ X29 @ X30 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X5: $i,X4: $i,X6: $i] :
( ( cQ_2 @ X4 @ X5 @ X6 )
| ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ ( f @ X1 ) @ X4 )
| ~ ( cP_1 @ ( f @ X2 ) @ X5 )
| ~ ( cP_1 @ ( f @ X3 ) @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
~ ( cQ_2 @ X1 @ X2 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X6: $i,X5: $i,X4: $i,X3: $i,X2: $i,X1: $i] :
( ~ ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cP_1 @ ( f @ X3 ) @ X4 )
| ~ ( cP_1 @ ( f @ X5 ) @ X6 )
| ~ ( cQ_1 @ X5 @ X3 @ X1 ) ),
inference(sr,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cP_1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cP_1 @ ( f @ X3 ) @ X4 )
| ~ ( cQ_1 @ X3 @ X1 @ X5 )
| ~ ( cP_1 @ X5 @ X6 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cP_1 @ ( f @ X1 ) @ X2 )
| ~ ( cQ_1 @ X1 @ X3 @ X4 )
| ~ ( cP_1 @ X4 @ X5 )
| ~ ( cP_1 @ X3 @ X6 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i,X1: $i,X4: $i,X5: $i,X6: $i] :
( ~ ( cQ_1 @ X1 @ X2 @ X3 )
| ~ ( cP_1 @ X3 @ X4 )
| ~ ( cP_1 @ X2 @ X5 )
| ~ ( cP_1 @ X1 @ X6 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
thf(c_0_11,negated_conjecture,
cQ_1 @ a @ b @ c,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( cP_1 @ c @ X1 )
| ~ ( cP_1 @ b @ X2 )
| ~ ( cP_1 @ a @ X3 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
cP_1 @ c @ c,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( cP_1 @ b @ X1 )
| ~ ( cP_1 @ a @ X2 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_15,negated_conjecture,
cP_1 @ b @ b,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
cP_1 @ a @ a,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
~ ( cP_1 @ a @ X1 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO383^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n002.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 16:52:37 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.24 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.yUZasYI74k/E---3.1_1547477.p
% 0.11/0.25 % Version: 3.5.1-ho
% 0.11/0.25 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.25 % Starting full_lambda_5 with 300s (1) cores
% 0.11/0.25 % Starting new_ho_10_unif with 300s (1) cores
% 0.11/0.25 % new_ho_10 with pid 1547490 completed with status 0
% 0.11/0.25 % Result found by new_ho_10
% 0.11/0.25 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25 % No SInE strategy applied
% 0.11/0.25 % Search class: HHUNF-FFSS11-SFFFFFNN
% 0.11/0.25 % partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.11/0.25 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.25 % Starting SubtermCWHack with 151s (1) cores
% 0.11/0.25 % Starting new_ho_10 with 901s (1) cores
% 0.11/0.25 % Starting sh5l with 151s (1) cores
% 0.11/0.25 % Starting new_bool_1 with 151s (1) cores
% 0.11/0.25 % Starting new_bool_2 with 146s (1) cores
% 0.11/0.25 % sh5l with pid 1547496 completed with status 0
% 0.11/0.25 % Result found by sh5l
% 0.11/0.25 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25 % No SInE strategy applied
% 0.11/0.25 % Search class: HHUNF-FFSS11-SFFFFFNN
% 0.11/0.25 % partial match(1): HHUNF-FFSF11-SFFFFFNN
% 0.11/0.25 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.25 % Starting SubtermCWHack with 151s (1) cores
% 0.11/0.25 % Starting new_ho_10 with 901s (1) cores
% 0.11/0.25 % Starting sh5l with 151s (1) cores
% 0.11/0.25 % Preprocessing time : 0.001 s
% 0.11/0.25 % Presaturation interreduction done
% 0.11/0.25
% 0.11/0.25 % Proof found!
% 0.11/0.25 % SZS status Theorem
% 0.11/0.25 % SZS output start CNFRefutation
% See solution above
% 0.11/0.26 % Parsed axioms : 9
% 0.11/0.26 % Removed by relevancy pruning/SinE : 0
% 0.11/0.26 % Initial clauses : 16
% 0.11/0.26 % Removed in clause preprocessing : 8
% 0.11/0.26 % Initial clauses in saturation : 8
% 0.11/0.26 % Processed clauses : 22
% 0.11/0.26 % ...of these trivial : 0
% 0.11/0.26 % ...subsumed : 0
% 0.11/0.26 % ...remaining for further processing : 22
% 0.11/0.26 % Other redundant clauses eliminated : 0
% 0.11/0.26 % Clauses deleted for lack of memory : 0
% 0.11/0.26 % Backward-subsumed : 2
% 0.11/0.26 % Backward-rewritten : 0
% 0.11/0.26 % Generated clauses : 7
% 0.11/0.26 % ...of the previous two non-redundant : 6
% 0.11/0.26 % ...aggressively subsumed : 0
% 0.11/0.26 % Contextual simplify-reflections : 0
% 0.11/0.26 % Paramodulations : 6
% 0.11/0.26 % Factorizations : 0
% 0.11/0.26 % NegExts : 0
% 0.11/0.26 % Equation resolutions : 0
% 0.11/0.26 % Disequality decompositions : 0
% 0.11/0.26 % Total rewrite steps : 0
% 0.11/0.26 % ...of those cached : 0
% 0.11/0.26 % Propositional unsat checks : 0
% 0.11/0.26 % Propositional check models : 0
% 0.11/0.26 % Propositional check unsatisfiable : 0
% 0.11/0.26 % Propositional clauses : 0
% 0.11/0.26 % Propositional clauses after purity: 0
% 0.11/0.26 % Propositional unsat core size : 0
% 0.11/0.26 % Propositional preprocessing time : 0.000
% 0.11/0.26 % Propositional encoding time : 0.000
% 0.11/0.26 % Propositional solver time : 0.000
% 0.11/0.26 % Success case prop preproc time : 0.000
% 0.11/0.26 % Success case prop encoding time : 0.000
% 0.11/0.26 % Success case prop solver time : 0.000
% 0.11/0.26 % Current number of processed clauses : 11
% 0.11/0.26 % Positive orientable unit clauses : 4
% 0.11/0.26 % Positive unorientable unit clauses: 0
% 0.11/0.26 % Negative unit clauses : 2
% 0.11/0.26 % Non-unit-clauses : 5
% 0.11/0.26 % Current number of unprocessed clauses: 0
% 0.11/0.26 % ...number of literals in the above : 0
% 0.11/0.26 % Current number of archived formulas : 0
% 0.11/0.26 % Current number of archived clauses : 11
% 0.11/0.26 % Clause-clause subsumption calls (NU) : 42
% 0.11/0.26 % Rec. Clause-clause subsumption calls : 16
% 0.11/0.26 % Non-unit clause-clause subsumptions : 1
% 0.11/0.26 % Unit Clause-clause subsumption calls : 6
% 0.11/0.26 % Rewrite failures with RHS unbound : 0
% 0.11/0.26 % BW rewrite match attempts : 0
% 0.11/0.26 % BW rewrite match successes : 0
% 0.11/0.26 % Condensation attempts : 23
% 0.11/0.26 % Condensation successes : 0
% 0.11/0.26 % Termbank termtop insertions : 1490
% 0.11/0.26 % Search garbage collected termcells : 103
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.001 s
% 0.11/0.26 % System time : 0.003 s
% 0.11/0.26 % Total time : 0.004 s
% 0.11/0.26 % Maximum resident set size: 3892 pages
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.007 s
% 0.11/0.26 % System time : 0.012 s
% 0.11/0.26 % Total time : 0.019 s
% 0.11/0.26 % Maximum resident set size: 4864 pages
% 0.11/0.26 % E exiting
%------------------------------------------------------------------------------