%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX186+1 : TPTP v9.3.1. Released v9.3.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 : Thu Sep 24 03:14:11 PM UTC 2026
% Result : Theorem 0.15s 15.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 12 unt; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 11 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 7 sgn 17 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_009,conjecture,
? [X6,X7,X8] :
~ ( drop(X6,X7) = drop(X6,X8)
=> X7 = X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_009) ).
fof(axiom_006,axiom,
! [X3] : drop(s(X3),nil) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
fof(axiom_003,axiom,
! [X1,X2] : nil != cons(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
fof(axiom_007,axiom,
! [X3,X2,X4] : drop(s(X3),cons(X2,X4)) = drop(X3,X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
fof(c_0_4,negated_conjecture,
~ ? [X6,X7,X8] :
~ ( drop(X6,X7) = drop(X6,X8)
=> X7 = X8 ),
inference(assume_negation,[status(cth)],[goal_009]) ).
fof(c_0_5,negated_conjecture,
! [X22,X23,X24] :
( X23 = X24
| drop(X22,X23) != drop(X22,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X17] : drop(s(X17),nil) = nil,
inference(variable_rename,[status(thm)],[axiom_006]) ).
fof(c_0_7,plain,
! [X1,X2] : nil != cons(X1,X2),
inference(fof_simplification,[status(thm)],[axiom_003]) ).
cnf(c_0_8,negated_conjecture,
( drop(X1,X2) != drop(X1,X3)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
drop(s(X1),nil) = nil,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X18,X19,X20] : drop(s(X18),cons(X19,X20)) = drop(X18,X20),
inference(variable_rename,[status(thm)],[axiom_007]) ).
fof(c_0_11,plain,
! [X13,X14] : nil != cons(X13,X14),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,negated_conjecture,
( drop(s(X2),X1) != nil
| X1 = nil ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
drop(s(X1),cons(X2,X3)) = drop(X1,X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
nil != cons(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
drop(X1,X2) != nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX186+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/15.39 % Computer : n008.cluster.edu
% 0.13/15.39 % Model : x86_64 x86_64
% 0.13/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/15.39 % Memory : 8046.5625MB
% 0.13/15.39 % OS : Linux 6.8.0-71-generic
% 0.13/15.39 % CPULimit : 300
% 0.13/15.39 % WCLimit : 300
% 0.13/15.39 % DateTime : Mon Sep 21 10:31:56 UTC 2026
% 0.13/15.39 % CPUTime :
% 0.13/15.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/15.44 Running first-order theorem proving
% 0.15/15.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/15.46 % Version: 3.5.1
% 0.15/15.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/15.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/15.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/15.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/15.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/15.46 % Starting sh5l with 300s (1) cores
% 0.15/15.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 763071 completed with status 0
% 0.15/15.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/15.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/15.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/15.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/15.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/15.46 % No SInE strategy applied
% 0.15/15.46 % Search class: FHUPM-FFSF21-SFFFFFNN
% 0.15/15.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/15.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/15.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/15.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.15/15.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/15.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/15.46 % new_bool_1 with pid 763079 completed with status 0
% 0.15/15.46 % Result found by new_bool_1
% 0.15/15.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/15.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/15.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/15.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/15.46 % No SInE strategy applied
% 0.15/15.46 % Search class: FHUPM-FFSF21-SFFFFFNN
% 0.15/15.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/15.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/15.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/15.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.15/15.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/15.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/15.46 % Preprocessing time : 0.001 s
% 0.15/15.46 % Presaturation interreduction done
% 0.15/15.46
% 0.15/15.46 % Proof found!
% 0.15/15.46 % SZS status Theorem
% 0.15/15.46 % SZS output start CNFRefutation
% See solution above
% 0.15/15.46 % Parsed axioms : 9
% 0.15/15.46 % Removed by relevancy pruning/SinE : 0
% 0.15/15.46 % Initial clauses : 9
% 0.15/15.46 % Removed in clause preprocessing : 0
% 0.15/15.46 % Initial clauses in saturation : 9
% 0.15/15.46 % Processed clauses : 20
% 0.15/15.46 % ...of these trivial : 0
% 0.15/15.46 % ...subsumed : 0
% 0.15/15.46 % ...remaining for further processing : 20
% 0.15/15.46 % Other redundant clauses eliminated : 0
% 0.15/15.46 % Clauses deleted for lack of memory : 0
% 0.15/15.46 % Backward-subsumed : 1
% 0.15/15.46 % Backward-rewritten : 0
% 0.15/15.46 % Generated clauses : 11
% 0.15/15.46 % ...of the previous two non-redundant : 5
% 0.15/15.46 % ...aggressively subsumed : 0
% 0.15/15.46 % Contextual simplify-reflections : 0
% 0.15/15.46 % Paramodulations : 9
% 0.15/15.46 % Factorizations : 0
% 0.15/15.46 % NegExts : 0
% 0.15/15.46 % Equation resolutions : 1
% 0.15/15.46 % Disequality decompositions : 0
% 0.15/15.46 % Total rewrite steps : 2
% 0.15/15.46 % ...of those cached : 0
% 0.15/15.46 % Propositional unsat checks : 0
% 0.15/15.46 % Propositional check models : 0
% 0.15/15.46 % Propositional check unsatisfiable : 0
% 0.15/15.46 % Propositional clauses : 0
% 0.15/15.46 % Propositional clauses after purity: 0
% 0.15/15.46 % Propositional unsat core size : 0
% 0.15/15.46 % Propositional preprocessing time : 0.000
% 0.15/15.46 % Propositional encoding time : 0.000
% 0.15/15.46 % Propositional solver time : 0.000
% 0.15/15.46 % Success case prop preproc time : 0.000
% 0.15/15.46 % Success case prop encoding time : 0.000
% 0.15/15.46 % Success case prop solver time : 0.000
% 0.15/15.46 % Current number of processed clauses : 9
% 0.15/15.46 % Positive orientable unit clauses : 5
% 0.15/15.46 % Positive unorientable unit clauses: 0
% 0.15/15.46 % Negative unit clauses : 3
% 0.15/15.46 % Non-unit-clauses : 1
% 0.15/15.46 % Current number of unprocessed clauses: 3
% 0.15/15.46 % ...number of literals in the above : 6
% 0.15/15.46 % Current number of archived formulas : 0
% 0.15/15.46 % Current number of archived clauses : 11
% 0.15/15.46 % Clause-clause subsumption calls (NU) : 0
% 0.15/15.46 % Rec. Clause-clause subsumption calls : 0
% 0.15/15.46 % Non-unit clause-clause subsumptions : 0
% 0.15/15.46 % Unit Clause-clause subsumption calls : 1
% 0.15/15.46 % Rewrite failures with RHS unbound : 0
% 0.15/15.46 % BW rewrite match attempts : 0
% 0.15/15.46 % BW rewrite match successes : 0
% 0.15/15.46 % Condensation attempts : 0
% 0.15/15.46 % Condensation successes : 0
% 0.15/15.46 % Termbank termtop insertions : 428
% 0.15/15.46 % Search garbage collected termcells : 33
% 0.15/15.46
% 0.15/15.46 % -------------------------------------------------
% 0.15/15.46 % User time : 0.002 s
% 0.15/15.46 % System time : 0.002 s
% 0.15/15.46 % Total time : 0.004 s
% 0.15/15.46 % Maximum resident set size: 3632 pages
% 0.15/15.46
% 0.15/15.46 % -------------------------------------------------
% 0.15/15.46 % User time : 0.008 s
% 0.15/15.46 % System time : 0.013 s
% 0.15/15.46 % Total time : 0.021 s
% 0.15/15.46 % Maximum resident set size: 4608 pages
% 0.15/15.46 % E exiting
%------------------------------------------------------------------------------