%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET891+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:18:50 PM UTC 2026
% Result : Theorem 0.24s 0.54s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 1 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(idempotence_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(t41_enumset1,axiom,
! [X1,X2] : unordered_pair(X1,X2) = set_union2(singleton(X1),singleton(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_enumset1) ).
fof(t32_zfmisc_1,conjecture,
! [X1,X2] : union(unordered_pair(singleton(X1),singleton(X2))) = unordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_zfmisc_1) ).
fof(l52_zfmisc_1,axiom,
! [X1,X2] : union(unordered_pair(X1,X2)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l52_zfmisc_1) ).
fof(c_0_4,plain,
! [X17] : set_union2(X17,X17) = X17,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k2_xboole_0])]) ).
fof(c_0_5,plain,
! [X9,X10] : unordered_pair(X9,X10) = set_union2(singleton(X9),singleton(X10)),
inference(variable_rename,[status(thm)],[t41_enumset1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] : union(unordered_pair(singleton(X1),singleton(X2))) = unordered_pair(X1,X2),
inference(assume_negation,[status(cth)],[t32_zfmisc_1]) ).
cnf(c_0_7,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
unordered_pair(X1,X2) = set_union2(singleton(X1),singleton(X2)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
union(unordered_pair(singleton(esk1_0),singleton(esk2_0))) != unordered_pair(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_6])])])]) ).
fof(c_0_10,plain,
! [X7,X8] : union(unordered_pair(X7,X8)) = set_union2(X7,X8),
inference(variable_rename,[status(thm)],[l52_zfmisc_1]) ).
cnf(c_0_11,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
union(unordered_pair(singleton(esk1_0),singleton(esk2_0))) != unordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
union(unordered_pair(X1,X2)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
set_union2(unordered_pair(X1,X1),singleton(X2)) = unordered_pair(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk1_0),unordered_pair(esk2_0,esk2_0)) != unordered_pair(esk1_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]),c_0_13]) ).
cnf(c_0_16,plain,
set_union2(unordered_pair(X1,X1),unordered_pair(X2,X2)) = unordered_pair(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET891+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n005.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 05:43:18 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 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.24/0.54 % Version: 3.5.1
% 0.24/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 % Starting sh5l with 300s (1) cores
% 0.24/0.54 % new_bool_3 with pid 2675457 completed with status 0
% 0.24/0.54 % Result found by new_bool_3
% 0.24/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.24/0.54 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.54 % SubtermCWHack with pid 2675463 completed with status 0
% 0.24/0.54 % Result found by SubtermCWHack
% 0.24/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.24/0.54 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.54 % Preprocessing time : 0.001 s
% 0.24/0.54
% 0.24/0.54 % Proof found!
% 0.24/0.54 % SZS status Theorem
% 0.24/0.54 % SZS output start CNFRefutation
% See solution above
% 0.24/0.54 % Parsed axioms : 10
% 0.24/0.54 % Removed by relevancy pruning/SinE : 0
% 0.24/0.54 % Initial clauses : 10
% 0.24/0.54 % Removed in clause preprocessing : 0
% 0.24/0.54 % Initial clauses in saturation : 10
% 0.24/0.54 % Processed clauses : 49
% 0.24/0.54 % ...of these trivial : 0
% 0.24/0.54 % ...subsumed : 29
% 0.24/0.54 % ...remaining for further processing : 20
% 0.24/0.54 % Other redundant clauses eliminated : 0
% 0.24/0.54 % Clauses deleted for lack of memory : 0
% 0.24/0.54 % Backward-subsumed : 0
% 0.24/0.54 % Backward-rewritten : 1
% 0.24/0.54 % Generated clauses : 64
% 0.24/0.54 % ...of the previous two non-redundant : 40
% 0.24/0.54 % ...aggressively subsumed : 0
% 0.24/0.54 % Contextual simplify-reflections : 0
% 0.24/0.54 % Paramodulations : 64
% 0.24/0.54 % Factorizations : 0
% 0.24/0.54 % NegExts : 0
% 0.24/0.54 % Equation resolutions : 0
% 0.24/0.54 % Disequality decompositions : 0
% 0.24/0.54 % Total rewrite steps : 23
% 0.24/0.54 % ...of those cached : 10
% 0.24/0.54 % Propositional unsat checks : 0
% 0.24/0.54 % Propositional check models : 0
% 0.24/0.54 % Propositional check unsatisfiable : 0
% 0.24/0.54 % Propositional clauses : 0
% 0.24/0.54 % Propositional clauses after purity: 0
% 0.24/0.54 % Propositional unsat core size : 0
% 0.24/0.54 % Propositional preprocessing time : 0.000
% 0.24/0.54 % Propositional encoding time : 0.000
% 0.24/0.54 % Propositional solver time : 0.000
% 0.24/0.54 % Success case prop preproc time : 0.000
% 0.24/0.54 % Success case prop encoding time : 0.000
% 0.24/0.54 % Success case prop solver time : 0.000
% 0.24/0.54 % Current number of processed clauses : 19
% 0.24/0.54 % Positive orientable unit clauses : 8
% 0.24/0.54 % Positive unorientable unit clauses: 3
% 0.24/0.54 % Negative unit clauses : 1
% 0.24/0.54 % Non-unit-clauses : 7
% 0.24/0.54 % Current number of unprocessed clauses: 1
% 0.24/0.54 % ...number of literals in the above : 1
% 0.24/0.54 % Current number of archived formulas : 0
% 0.24/0.54 % Current number of archived clauses : 1
% 0.24/0.54 % Clause-clause subsumption calls (NU) : 28
% 0.24/0.54 % Rec. Clause-clause subsumption calls : 28
% 0.24/0.54 % Non-unit clause-clause subsumptions : 15
% 0.24/0.54 % Unit Clause-clause subsumption calls : 1
% 0.24/0.54 % Rewrite failures with RHS unbound : 0
% 0.24/0.54 % BW rewrite match attempts : 11
% 0.24/0.54 % BW rewrite match successes : 9
% 0.24/0.54 % Condensation attempts : 0
% 0.24/0.54 % Condensation successes : 0
% 0.24/0.54 % Termbank termtop insertions : 872
% 0.24/0.54 % Search garbage collected termcells : 46
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.006 s
% 0.24/0.54 % System time : 0.002 s
% 0.24/0.54 % Total time : 0.008 s
% 0.24/0.54 % Maximum resident set size: 3636 pages
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.009 s
% 0.24/0.54 % System time : 0.007 s
% 0.24/0.54 % Total time : 0.016 s
% 0.24/0.54 % Maximum resident set size: 4608 pages
% 0.24/0.54 % E exiting
%------------------------------------------------------------------------------