%------------------------------------------------------------------------------
% 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 : n015.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:12 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 40 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_005,axiom,
prop_drop_inj2(X1,X2,X3) = impl(eq(drop(X1,X2),drop(X1,X3)),eq(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_002,axiom,
drop(s(X1),nil) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
cnf(goal,negated_conjecture,
eq3(prop_drop_inj2(X1,X2,X3),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(axiom_017,axiom,
eq(cons(X1,X2),nil) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).
cnf(axiom_003,axiom,
drop(s(X1),cons(X2,X3)) = drop(X1,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_011,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_011) ).
cnf(axiom,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_013,axiom,
eq3(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).
cnf(c_0_8,axiom,
prop_drop_inj2(X1,X2,X3) = impl(eq(drop(X1,X2),drop(X1,X3)),eq(X2,X3)),
axiom_005 ).
cnf(c_0_9,axiom,
drop(s(X1),nil) = nil,
axiom_002 ).
cnf(c_0_10,negated_conjecture,
eq3(prop_drop_inj2(X1,X2,X3),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_11,plain,
impl(eq(drop(s(X1),X2),nil),eq(X2,nil)) = prop_drop_inj2(s(X1),X2,nil),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
eq(cons(X1,X2),nil) = bfalse,
axiom_017 ).
cnf(c_0_13,axiom,
drop(s(X1),cons(X2,X3)) = drop(X1,X3),
axiom_003 ).
cnf(c_0_14,negated_conjecture,
eq3(prop_drop_inj2(X1,X2,X3),bfalse) != btrue,
c_0_10 ).
cnf(c_0_15,plain,
prop_drop_inj2(s(X1),cons(X2,X3),nil) = impl(eq(drop(X1,X3),nil),bfalse),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
eq3(impl(eq(drop(X1,X2),nil),bfalse),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
eq(X1,X1) = btrue,
axiom_011 ).
cnf(c_0_18,axiom,
impl(btrue,X1) = X1,
axiom ).
cnf(c_0_19,axiom,
eq3(X1,X1) = btrue,
axiom_013 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX186-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 % Computer : n015.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Mon Sep 21 10:34:53 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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.20/0.48 % Version: 3.5.1
% 0.20/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 % Starting sh5l with 300s (1) cores
% 0.20/0.48 % new_bool_1 with pid 1247895 completed with status 0
% 0.20/0.48 % Result found by new_bool_1
% 0.20/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 % Search class: FHUPM-FFSF32-MFFFFFNN
% 0.20/0.48 % partial match(1): FUUPM-FFSF32-MFFFFFNN
% 0.20/0.48 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.48 % SubtermCWHack with pid 1247902 completed with status 0
% 0.20/0.48 % Result found by SubtermCWHack
% 0.20/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 % Search class: FHUPM-FFSF32-MFFFFFNN
% 0.20/0.48 % partial match(1): FUUPM-FFSF32-MFFFFFNN
% 0.20/0.48 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.48 % Preprocessing time : 0.001 s
% 0.20/0.48
% 0.20/0.48 % Proof found!
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start CNFRefutation
% See solution above
% 0.20/0.48 % Parsed axioms : 19
% 0.20/0.48 % Removed by relevancy pruning/SinE : 0
% 0.20/0.48 % Initial clauses : 19
% 0.20/0.48 % Removed in clause preprocessing : 0
% 0.20/0.48 % Initial clauses in saturation : 19
% 0.20/0.48 % Processed clauses : 41
% 0.20/0.48 % ...of these trivial : 4
% 0.20/0.48 % ...subsumed : 7
% 0.20/0.48 % ...remaining for further processing : 30
% 0.20/0.48 % Other redundant clauses eliminated : 0
% 0.20/0.48 % Clauses deleted for lack of memory : 0
% 0.20/0.48 % Backward-subsumed : 1
% 0.20/0.48 % Backward-rewritten : 0
% 0.20/0.48 % Generated clauses : 46
% 0.20/0.48 % ...of the previous two non-redundant : 37
% 0.20/0.48 % ...aggressively subsumed : 0
% 0.20/0.48 % Contextual simplify-reflections : 0
% 0.20/0.48 % Paramodulations : 46
% 0.20/0.48 % Factorizations : 0
% 0.20/0.48 % NegExts : 0
% 0.20/0.48 % Equation resolutions : 0
% 0.20/0.48 % Disequality decompositions : 0
% 0.20/0.48 % Total rewrite steps : 44
% 0.20/0.48 % ...of those cached : 22
% 0.20/0.48 % Propositional unsat checks : 0
% 0.20/0.48 % Propositional check models : 0
% 0.20/0.48 % Propositional check unsatisfiable : 0
% 0.20/0.48 % Propositional clauses : 0
% 0.20/0.48 % Propositional clauses after purity: 0
% 0.20/0.48 % Propositional unsat core size : 0
% 0.20/0.48 % Propositional preprocessing time : 0.000
% 0.20/0.48 % Propositional encoding time : 0.000
% 0.20/0.48 % Propositional solver time : 0.000
% 0.20/0.48 % Success case prop preproc time : 0.000
% 0.20/0.48 % Success case prop encoding time : 0.000
% 0.20/0.48 % Success case prop solver time : 0.000
% 0.20/0.48 % Current number of processed clauses : 29
% 0.20/0.48 % Positive orientable unit clauses : 22
% 0.20/0.48 % Positive unorientable unit clauses: 0
% 0.20/0.48 % Negative unit clauses : 3
% 0.20/0.48 % Non-unit-clauses : 4
% 0.20/0.48 % Current number of unprocessed clauses: 11
% 0.20/0.48 % ...number of literals in the above : 16
% 0.20/0.48 % Current number of archived formulas : 0
% 0.20/0.48 % Current number of archived clauses : 1
% 0.20/0.48 % Clause-clause subsumption calls (NU) : 4
% 0.20/0.48 % Rec. Clause-clause subsumption calls : 4
% 0.20/0.48 % Non-unit clause-clause subsumptions : 3
% 0.20/0.48 % Unit Clause-clause subsumption calls : 3
% 0.20/0.48 % Rewrite failures with RHS unbound : 0
% 0.20/0.48 % BW rewrite match attempts : 4
% 0.20/0.48 % BW rewrite match successes : 0
% 0.20/0.48 % Condensation attempts : 0
% 0.20/0.48 % Condensation successes : 0
% 0.20/0.48 % Termbank termtop insertions : 808
% 0.20/0.48 % Search garbage collected termcells : 8
% 0.20/0.48
% 0.20/0.48 % -------------------------------------------------
% 0.20/0.48 % User time : 0.003 s
% 0.20/0.48 % System time : 0.001 s
% 0.20/0.48 % Total time : 0.004 s
% 0.20/0.48 % Maximum resident set size: 3640 pages
% 0.20/0.48
% 0.20/0.48 % -------------------------------------------------
% 0.20/0.48 % User time : 0.006 s
% 0.20/0.48 % System time : 0.004 s
% 0.20/0.48 % Total time : 0.010 s
% 0.20/0.48 % Maximum resident set size: 4608 pages
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------