%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET047-5 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:13:17 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 28 ( 4 unt; 8 nHn; 24 RR)
% Number of literals : 66 ( 0 equ; 30 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(element_substitution1,axiom,
( ~ element(X3,X1)
| ~ set_equal(X1,X2)
| element(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitution1) ).
cnf(element_substitution2,axiom,
( ~ element(X3,X2)
| ~ set_equal(X1,X2)
| element(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitution2) ).
cnf(prove_symmetry1,negated_conjecture,
( set_equal(b,a)
| set_equal(a,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_symmetry1) ).
cnf(clause_3,axiom,
( set_equal(X1,X2)
| element(f(X1,X2),X2)
| element(f(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
( ~ element(f(X1,X2),X1)
| ~ element(f(X1,X2),X2)
| set_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(prove_symmetry2,negated_conjecture,
( ~ set_equal(a,b)
| ~ set_equal(b,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_symmetry2) ).
cnf(c_0_6,plain,
( ~ element(X3,X1)
| ~ set_equal(X1,X2)
| element(X3,X2) ),
inference(fof_simplification,[status(thm)],[element_substitution1]) ).
cnf(c_0_7,plain,
( ~ element(X3,X2)
| ~ set_equal(X1,X2)
| element(X3,X1) ),
inference(fof_simplification,[status(thm)],[element_substitution2]) ).
cnf(c_0_8,plain,
( ~ element(X3,X1)
| ~ set_equal(X1,X2)
| element(X3,X2) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
( set_equal(b,a)
| set_equal(a,b) ),
prove_symmetry1 ).
cnf(c_0_10,plain,
( ~ element(X3,X2)
| ~ set_equal(X1,X2)
| element(X3,X1) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( ~ element(X1,a)
| element(X1,b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,axiom,
( set_equal(X1,X2)
| element(f(X1,X2),X2)
| element(f(X1,X2),X1) ),
clause_3 ).
cnf(c_0_13,plain,
( ~ element(f(X1,X2),X1)
| ~ element(f(X1,X2),X2)
| set_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_14,negated_conjecture,
( set_equal(a,X1)
| element(f(a,X1),X1)
| element(f(a,X1),b) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ element(f(X1,X2),X1)
| ~ element(f(X1,X2),X2)
| set_equal(X1,X2) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
( set_equal(a,b)
| element(f(a,b),b) ),
inference(ef,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ set_equal(a,b)
| ~ set_equal(b,a) ),
inference(fof_simplification,[status(thm)],[prove_symmetry2]) ).
cnf(c_0_18,negated_conjecture,
( ~ element(f(a,b),a)
| set_equal(a,b) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ element(X1,b)
| element(X1,a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( set_equal(X1,a)
| element(f(X1,a),X1)
| element(f(X1,a),b) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( ~ set_equal(a,b)
| ~ set_equal(b,a) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
set_equal(a,b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( set_equal(b,a)
| element(f(b,a),b) ),
inference(ef,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ set_equal(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( ~ element(f(X1,a),X1)
| ~ element(f(X1,a),b)
| set_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
element(f(b,a),b),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET047-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:52:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % sh5l with pid 1590280 completed with status 0
% 0.14/0.43 % Result found by sh5l
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 1590286 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 6
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 6
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 6
% 0.14/0.43 % Processed clauses : 23
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 3
% 0.14/0.43 % ...remaining for further processing : 20
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 1
% 0.14/0.43 % Backward-rewritten : 5
% 0.14/0.43 % Generated clauses : 30
% 0.14/0.43 % ...of the previous two non-redundant : 21
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 4
% 0.14/0.43 % Paramodulations : 23
% 0.14/0.43 % Factorizations : 6
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 9
% 0.14/0.43 % ...of those cached : 5
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 13
% 0.14/0.43 % Positive orientable unit clauses : 3
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 1
% 0.14/0.43 % Non-unit-clauses : 9
% 0.14/0.43 % Current number of unprocessed clauses: 4
% 0.14/0.43 % ...number of literals in the above : 9
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 7
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 27
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 22
% 0.14/0.43 % Non-unit clause-clause subsumptions : 7
% 0.14/0.43 % Unit Clause-clause subsumption calls : 7
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 8
% 0.14/0.43 % BW rewrite match successes : 3
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 542
% 0.14/0.43 % Search garbage collected termcells : 14
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.003 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.006 s
% 0.14/0.43 % Maximum resident set size: 3632 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.004 s
% 0.14/0.43 % System time : 0.006 s
% 0.14/0.43 % Total time : 0.010 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------