%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : DAT056^2 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 07:47:43 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 31 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 322 ( 12 ~; 14 |; 1 &; 292 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 10 ^; 32 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
lst: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
ap: lst > lst > lst ).
thf(decl_24,type,
cns: a > lst > lst ).
thf(decl_25,type,
nl: lst ).
thf(decl_26,type,
xs: lst ).
thf(decl_27,type,
esk1_0: lst ).
thf(decl_28,type,
esk2_0: lst ).
thf(decl_29,type,
esk3_2: lst > ( lst > $o ) > a ).
thf(decl_30,type,
esk4_2: lst > ( lst > $o ) > lst ).
thf(conj_0,conjecture,
! [X8: lst,X9: lst] :
( ( ap @ xs @ ( ap @ X8 @ X9 ) )
= ( ap @ ( ap @ xs @ X8 ) @ X9 ) ),
file('/export/starexec/sandbox2/tmp/tmp.gA7KfTRU9I/E---3.1_3511493.p',conj_0) ).
thf(fact_0_lst_Oinduct,axiom,
! [X1: lst,X2: lst > $o] :
( ( X2 @ nl )
=> ( ! [X3: a,X4: lst] :
( ( X2 @ X4 )
=> ( X2 @ ( cns @ X3 @ X4 ) ) )
=> ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gA7KfTRU9I/E---3.1_3511493.p',fact_0_lst_Oinduct) ).
thf(fact_2p_Osimps_I1_J,axiom,
! [X5: lst] :
( ( ap @ nl @ X5 )
= X5 ),
file('/export/starexec/sandbox2/tmp/tmp.gA7KfTRU9I/E---3.1_3511493.p',fact_2p_Osimps_I1_J) ).
thf(fact_1p_Osimps_I2_J,axiom,
! [X5: lst,X6: lst,X7: a] :
( ( ap @ ( cns @ X7 @ X6 ) @ X5 )
= ( cns @ X7 @ ( ap @ X6 @ X5 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gA7KfTRU9I/E---3.1_3511493.p',fact_1p_Osimps_I2_J) ).
thf(c_0_4,negated_conjecture,
~ ! [X8: lst,X9: lst] :
( ( ap @ xs @ ( ap @ X8 @ X9 ) )
= ( ap @ ( ap @ xs @ X8 ) @ X9 ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_5,plain,
! [X26: lst,X27: lst > $o] :
( ( ( X27 @ ( esk4_2 @ X26 @ X27 ) )
| ( X27 @ X26 )
| ~ ( X27 @ nl ) )
& ( ~ ( X27 @ ( cns @ ( esk3_2 @ X26 @ X27 ) @ ( esk4_2 @ X26 @ X27 ) ) )
| ( X27 @ X26 )
| ~ ( X27 @ nl ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_lst_Oinduct])])])])]) ).
thf(c_0_6,negated_conjecture,
( ( ap @ xs @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ xs @ esk1_0 ) @ esk2_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,plain,
! [X1: lst,X2: lst > $o] :
( ( X2 @ ( esk4_2 @ X1 @ X2 ) )
| ( X2 @ X1 )
| ~ ( X2 @ nl ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( ap @ xs @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ xs @ esk1_0 ) @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X25: lst] :
( ( ap @ nl @ X25 )
= X25 ),
inference(variable_rename,[status(thm)],[fact_2p_Osimps_I1_J]) ).
thf(c_0_10,plain,
! [X22: lst,X23: lst,X24: a] :
( ( ap @ ( cns @ X24 @ X23 ) @ X22 )
= ( cns @ X24 @ ( ap @ X23 @ X22 ) ) ),
inference(variable_rename,[status(thm)],[fact_1p_Osimps_I2_J]) ).
thf(c_0_11,plain,
! [X1: lst] :
( ( ( ap @ X1 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ X1 @ esk1_0 ) @ esk2_0 ) )
| ( ( ap
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) )
@ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap
@ ( ap
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) )
@ esk1_0 )
@ esk2_0 ) )
| ( ( ap @ nl @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ nl @ esk1_0 ) @ esk2_0 ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7,c_0_8]) ).
thf(c_0_12,plain,
! [X1: lst] :
( ( ap @ nl @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
! [X1: lst,X2: lst > $o] :
( ( X2 @ X1 )
| ~ ( X2 @ ( cns @ ( esk3_2 @ X1 @ X2 ) @ ( esk4_2 @ X1 @ X2 ) ) )
| ~ ( X2 @ nl ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,plain,
! [X1: lst,X3: a,X4: lst] :
( ( ap @ ( cns @ X3 @ X1 ) @ X4 )
= ( cns @ X3 @ ( ap @ X1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X1: lst] :
( ( ( ap
@ ( ap
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) )
@ esk1_0 )
@ esk2_0 )
= ( ap
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) )
@ ( ap @ esk1_0 @ esk2_0 ) ) )
| ( ( ap @ ( ap @ X1 @ esk1_0 ) @ esk2_0 )
= ( ap @ X1 @ ( ap @ esk1_0 @ esk2_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12])]) ).
thf(c_0_16,plain,
! [X1: lst] :
( ( ( ap @ X1 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ X1 @ esk1_0 ) @ esk2_0 ) )
| ( ( ap @ nl @ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap @ ( ap @ nl @ esk1_0 ) @ esk2_0 ) )
| ( ( ap
@ ( cns
@ ( esk3_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) )
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) ) )
@ ( ap @ esk1_0 @ esk2_0 ) )
!= ( ap
@ ( ap
@ ( cns
@ ( esk3_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) )
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) ) )
@ esk1_0 )
@ esk2_0 ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_13,c_0_8]) ).
thf(c_0_17,plain,
! [X3: a,X1: lst] :
( ( ( ap
@ ( ap
@ ( cns @ X3
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) ) )
@ esk1_0 )
@ esk2_0 )
= ( ap
@ ( cns @ X3
@ ( esk4_2 @ X1
@ ^ [Z0: lst] :
( ( ap @ Z0 @ ( ap @ esk1_0 @ esk2_0 ) )
= ( ap @ ( ap @ Z0 @ esk1_0 ) @ esk2_0 ) ) ) )
@ ( ap @ esk1_0 @ esk2_0 ) ) )
| ( ( ap @ ( ap @ X1 @ esk1_0 ) @ esk2_0 )
= ( ap @ X1 @ ( ap @ esk1_0 @ esk2_0 ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]),c_0_14]) ).
thf(c_0_18,plain,
! [X1: lst] :
( ( ap @ ( ap @ X1 @ esk1_0 ) @ esk2_0 )
= ( ap @ X1 @ ( ap @ esk1_0 @ esk2_0 ) ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_12]),c_0_12])]),c_0_17]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT056^2 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n008.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 17:58:54 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.08/0.25 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.gA7KfTRU9I/E---3.1_3511493.p
% 0.21/0.28 % Version: 3.5.1-ho
% 0.21/0.28 % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.21/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28 % Starting new_ho_14 with 1500s (5) cores
% 0.21/0.28 % Starting full_lambda_8 with 300s (1) cores
% 0.21/0.28 % Starting new_ho_13 with 300s (1) cores
% 0.21/0.28 % Starting ho_unfolding_3 with 300s (1) cores
% 0.21/0.28 % new_ho_14 with pid 3511506 completed with status 0
% 0.21/0.28 % Result found by new_ho_14
% 0.21/0.28 % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.21/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28 % Starting new_ho_14 with 1500s (5) cores
% 0.21/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.28 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.28 % Search class: HGUSS-FFMF22-DSFFFSBN
% 0.21/0.28 % partial match(3): HGUSS-FFSF21-SSFFFSBN
% 0.21/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.21/0.28 % Starting new_ho_14 with 901s (1) cores
% 0.21/0.28 % Starting new_ho_13 with 151s (1) cores
% 0.21/0.28 % Starting new_bool_3 with 151s (1) cores
% 0.21/0.28 % Starting new_bool_1 with 146s (1) cores
% 0.21/0.28 % SubtermCWHack with pid 3511511 completed with status 0
% 0.21/0.28 % Result found by SubtermCWHack
% 0.21/0.28 % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.21/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28 % Starting new_ho_14 with 1500s (5) cores
% 0.21/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.28 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.28 % Search class: HGUSS-FFMF22-DSFFFSBN
% 0.21/0.28 % partial match(3): HGUSS-FFSF21-SSFFFSBN
% 0.21/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.21/0.28 % Preprocessing time : 0.001 s
% 0.21/0.28
% 0.21/0.28 % Proof found!
% 0.21/0.28 % SZS status Theorem
% 0.21/0.28 % SZS output start CNFRefutation
% See solution above
% 0.21/0.28 % Parsed axioms : 10
% 0.21/0.28 % Removed by relevancy pruning/SinE : 6
% 0.21/0.28 % Initial clauses : 5
% 0.21/0.28 % Removed in clause preprocessing : 0
% 0.21/0.28 % Initial clauses in saturation : 13
% 0.21/0.28 % Processed clauses : 44
% 0.21/0.28 % ...of these trivial : 0
% 0.21/0.28 % ...subsumed : 0
% 0.21/0.28 % ...remaining for further processing : 44
% 0.21/0.28 % Other redundant clauses eliminated : 0
% 0.21/0.28 % Clauses deleted for lack of memory : 0
% 0.21/0.28 % Backward-subsumed : 0
% 0.21/0.28 % Backward-rewritten : 9
% 0.21/0.28 % Generated clauses : 56
% 0.21/0.28 % ...of the previous two non-redundant : 37
% 0.21/0.28 % ...aggressively subsumed : 0
% 0.21/0.28 % Contextual simplify-reflections : 1
% 0.21/0.28 % Paramodulations : 55
% 0.21/0.28 % Factorizations : 0
% 0.21/0.28 % NegExts : 0
% 0.21/0.28 % Equation resolutions : 0
% 0.21/0.28 % Disequality decompositions : 0
% 0.21/0.28 % Total rewrite steps : 56
% 0.21/0.28 % ...of those cached : 7
% 0.21/0.28 % Propositional unsat checks : 0
% 0.21/0.28 % Propositional check models : 0
% 0.21/0.28 % Propositional check unsatisfiable : 0
% 0.21/0.28 % Propositional clauses : 0
% 0.21/0.28 % Propositional clauses after purity: 0
% 0.21/0.28 % Propositional unsat core size : 0
% 0.21/0.28 % Propositional preprocessing time : 0.000
% 0.21/0.28 % Propositional encoding time : 0.000
% 0.21/0.28 % Propositional solver time : 0.000
% 0.21/0.28 % Success case prop preproc time : 0.000
% 0.21/0.28 % Success case prop encoding time : 0.000
% 0.21/0.28 % Success case prop solver time : 0.000
% 0.21/0.28 % Current number of processed clauses : 34
% 0.21/0.28 % Positive orientable unit clauses : 20
% 0.21/0.28 % Positive unorientable unit clauses: 0
% 0.21/0.28 % Negative unit clauses : 0
% 0.21/0.28 % Non-unit-clauses : 14
% 0.21/0.28 % Current number of unprocessed clauses: 6
% 0.21/0.28 % ...number of literals in the above : 15
% 0.21/0.28 % Current number of archived formulas : 0
% 0.21/0.28 % Current number of archived clauses : 11
% 0.21/0.28 % Clause-clause subsumption calls (NU) : 160
% 0.21/0.28 % Rec. Clause-clause subsumption calls : 106
% 0.21/0.28 % Non-unit clause-clause subsumptions : 1
% 0.21/0.28 % Unit Clause-clause subsumption calls : 68
% 0.21/0.28 % Rewrite failures with RHS unbound : 0
% 0.21/0.28 % BW rewrite match attempts : 184
% 0.21/0.28 % BW rewrite match successes : 10
% 0.21/0.28 % Condensation attempts : 0
% 0.21/0.28 % Condensation successes : 0
% 0.21/0.28 % Termbank termtop insertions : 6863
% 0.21/0.28 % Search garbage collected termcells : 114
% 0.21/0.28
% 0.21/0.28 % -------------------------------------------------
% 0.21/0.28 % User time : 0.007 s
% 0.21/0.28 % System time : 0.004 s
% 0.21/0.28 % Total time : 0.011 s
% 0.21/0.28 % Maximum resident set size: 3640 pages
% 0.21/0.28
% 0.21/0.28 % -------------------------------------------------
% 0.21/0.28 % User time : 0.024 s
% 0.21/0.28 % System time : 0.016 s
% 0.21/0.28 % Total time : 0.040 s
% 0.21/0.28 % Maximum resident set size: 4864 pages
% 0.21/0.28 % E exiting
%------------------------------------------------------------------------------