%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX207+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:16 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 22 unt; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 15 ~; 7 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 2 sgn 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_027,conjecture,
? [X8,X9] :
~ ( linC(X8) = linC(X9)
=> X8 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_027) ).
fof(axiom_026,axiom,
! [X6,X7] : linC(c2(X6,X7)) = append(linP(X6),linP(X7)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_026) ).
fof(axiom_019,axiom,
! [X3] : append(nil,X3) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
fof(axiom_025,axiom,
linP(pE) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_025) ).
fof(axiom_020,axiom,
! [X3,X4,X5] : append(cons(X4,X5),X3) = cons(X4,append(X5,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
fof(axiom_016,axiom,
pB != pE,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
fof(axiom_017,axiom,
! [X1,X2] : proj1C(c2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_017) ).
fof(axiom_024,axiom,
linP(pB) = cons(b,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_024) ).
fof(c_0_8,negated_conjecture,
~ ? [X8,X9] :
~ ( linC(X8) = linC(X9)
=> X8 = X9 ),
inference(assume_negation,[status(cth)],[goal_027]) ).
fof(c_0_9,negated_conjecture,
! [X38,X39] :
( X38 = X39
| linC(X38) != linC(X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X36,X37] : linC(c2(X36,X37)) = append(linP(X36),linP(X37)),
inference(variable_rename,[status(thm)],[axiom_026]) ).
cnf(c_0_11,negated_conjecture,
( linC(X1) != linC(X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
linC(c2(X1,X2)) = append(linP(X1),linP(X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X30] : append(nil,X30) = X30,
inference(variable_rename,[status(thm)],[axiom_019]) ).
cnf(c_0_14,negated_conjecture,
( append(linP(X1),linP(X2)) != linC(X3)
| c2(X1,X2) = X3 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
linP(pE) = nil,
inference(split_conjunct,[status(thm)],[axiom_025]) ).
cnf(c_0_16,plain,
append(nil,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( linP(X1) != linC(X2)
| c2(pE,X1) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( linP(X1) != append(linP(X2),linP(X3))
| c2(pE,X1) = c2(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
fof(c_0_19,plain,
! [X31,X32,X33] : append(cons(X32,X33),X31) = cons(X32,append(X33,X31)),
inference(variable_rename,[status(thm)],[axiom_020]) ).
fof(c_0_20,plain,
pB != pE,
inference(fof_simplification,[status(thm)],[axiom_016]) ).
fof(c_0_21,plain,
! [X26,X27] : proj1C(c2(X26,X27)) = X26,
inference(variable_rename,[status(thm)],[axiom_017]) ).
cnf(c_0_22,negated_conjecture,
( linP(X1) != append(linP(X2),nil)
| c2(pE,X1) = c2(X2,pE) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_23,plain,
linP(pB) = cons(b,nil),
inference(split_conjunct,[status(thm)],[axiom_024]) ).
cnf(c_0_24,plain,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
pB != pE,
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
proj1C(c2(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( linP(X1) != cons(b,nil)
| c2(pE,X1) = c2(pB,pE) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_16]) ).
cnf(c_0_28,plain,
pB != pE,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
linP(X1) != cons(b,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]),c_0_28]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[c_0_23,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX207+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 10:33:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 673371 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FHUPM-FFSS21-MFFFFFNN
% 0.11/0.45 % partial match(1): FHUPM-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.11/0.45 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.11/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 673376 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FHUPM-FFSS21-MFFFFFNN
% 0.11/0.45 % partial match(1): FHUPM-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45 % Presaturation interreduction done
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 27
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 27
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 27
% 0.11/0.45 % Processed clauses : 103
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 7
% 0.11/0.45 % ...remaining for further processing : 96
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 1
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 216
% 0.11/0.45 % ...of the previous two non-redundant : 197
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 212
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 3
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 284
% 0.11/0.45 % ...of those cached : 203
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 67
% 0.11/0.45 % Positive orientable unit clauses : 21
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 15
% 0.11/0.45 % Non-unit-clauses : 31
% 0.11/0.45 % Current number of unprocessed clauses: 148
% 0.11/0.45 % ...number of literals in the above : 280
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 29
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 422
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 356
% 0.11/0.45 % Non-unit clause-clause subsumptions : 1
% 0.11/0.45 % Unit Clause-clause subsumption calls : 74
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 4429
% 0.11/0.45 % Search garbage collected termcells : 81
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.007 s
% 0.11/0.45 % System time : 0.003 s
% 0.11/0.45 % Total time : 0.010 s
% 0.11/0.45 % Maximum resident set size: 3648 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.029 s
% 0.11/0.45 % System time : 0.014 s
% 0.11/0.45 % Total time : 0.043 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------