%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET019-4 : TPTP v9.3.1. Released v1.0.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 02:13:07 PM UTC 2026
% Result : Unsatisfiable 1.98s 0.84s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 10 unt; 3 nHn; 18 RR)
% Number of literals : 41 ( 9 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subset1,axiom,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',subset1) ).
cnf(b_contains_a,hypothesis,
subset(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_contains_a) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality2) ).
cnf(prove__a_equals_b,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove__a_equals_b) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality3) ).
cnf(a_contains_b,hypothesis,
subset(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_contains_b) ).
cnf(c_0_6,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subset1]) ).
cnf(c_0_7,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
c_0_6 ).
cnf(c_0_8,hypothesis,
subset(a,b),
b_contains_a ).
cnf(c_0_9,hypothesis,
( ~ member(X1,a)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_11,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove__a_equals_b]) ).
cnf(c_0_12,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_13,hypothesis,
( member(f1(a,X1),X1)
| member(f1(a,X1),b)
| a = X1 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
a != b,
c_0_11 ).
cnf(c_0_15,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_12 ).
cnf(c_0_16,hypothesis,
member(f1(a,b),b),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_17,hypothesis,
subset(b,a),
a_contains_b ).
cnf(c_0_18,hypothesis,
~ member(f1(a,b),a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_19,hypothesis,
( ~ member(X1,b)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET019-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.38 % Computer : n010.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Sep 21 04:43:24 UTC 2026
% 0.14/0.38 % CPUTime :
% 0.14/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/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
% 1.98/0.84 % Version: 3.5.1
% 1.98/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.98/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.98/0.84 % Starting new_bool_3 with 300s (1) cores
% 1.98/0.84 % Starting new_bool_1 with 300s (1) cores
% 1.98/0.84 % Starting sh5l with 300s (1) cores
% 1.98/0.84 % new_bool_3 with pid 43259 completed with status 9
% 1.98/0.84 % new_bool_1 with pid 43260 completed with status 9
% 1.98/0.84 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 43258 completed with status 0
% 1.98/0.84 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.98/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.98/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.98/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.98/0.84 % No SInE strategy applied
% 1.98/0.84 % Search class: FGHSF-FFLS31-MFFFFFNN
% 1.98/0.84 % partial match(1): FGHSM-FFLS31-MFFFFFNN
% 1.98/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.98/0.84 % Starting SubtermCWHack with 136s (1) cores
% 1.98/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.98/0.84 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 224s (1) cores
% 1.98/0.84 % Starting new_bool_3 with 216s (1) cores
% 1.98/0.84 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 1.98/0.84 % SubtermCWHack with pid 43265 completed with status 0
% 1.98/0.84 % Result found by SubtermCWHack
% 1.98/0.84 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.98/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.84 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.98/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.98/0.84 % No SInE strategy applied
% 1.98/0.84 % Search class: FGHSF-FFLS31-MFFFFFNN
% 1.98/0.84 % partial match(1): FGHSM-FFLS31-MFFFFFNN
% 1.98/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.98/0.84 % Starting SubtermCWHack with 136s (1) cores
% 1.98/0.84 % Preprocessing time : 0.003 s
% 1.98/0.84
% 1.98/0.84 % Proof found!
% 1.98/0.84 % SZS status Unsatisfiable
% 1.98/0.84 % SZS output start CNFRefutation
% See solution above
% 1.98/0.84 % Parsed axioms : 144
% 1.98/0.84 % Removed by relevancy pruning/SinE : 0
% 1.98/0.84 % Initial clauses : 144
% 1.98/0.84 % Removed in clause preprocessing : 6
% 1.98/0.84 % Initial clauses in saturation : 138
% 1.98/0.84 % Processed clauses : 2216
% 1.98/0.84 % ...of these trivial : 27
% 1.98/0.84 % ...subsumed : 1172
% 1.98/0.84 % ...remaining for further processing : 1017
% 1.98/0.84 % Other redundant clauses eliminated : 28
% 1.98/0.84 % Clauses deleted for lack of memory : 0
% 1.98/0.84 % Backward-subsumed : 31
% 1.98/0.84 % Backward-rewritten : 41
% 1.98/0.84 % Generated clauses : 12962
% 1.98/0.84 % ...of the previous two non-redundant : 11960
% 1.98/0.84 % ...aggressively subsumed : 0
% 1.98/0.84 % Contextual simplify-reflections : 22
% 1.98/0.84 % Paramodulations : 12912
% 1.98/0.84 % Factorizations : 22
% 1.98/0.84 % NegExts : 0
% 1.98/0.84 % Equation resolutions : 28
% 1.98/0.84 % Disequality decompositions : 0
% 1.98/0.84 % Total rewrite steps : 2547
% 1.98/0.84 % ...of those cached : 2354
% 1.98/0.84 % Propositional unsat checks : 0
% 1.98/0.84 % Propositional check models : 0
% 1.98/0.84 % Propositional check unsatisfiable : 0
% 1.98/0.84 % Propositional clauses : 0
% 1.98/0.84 % Propositional clauses after purity: 0
% 1.98/0.84 % Propositional unsat core size : 0
% 1.98/0.84 % Propositional preprocessing time : 0.000
% 1.98/0.84 % Propositional encoding time : 0.000
% 1.98/0.84 % Propositional solver time : 0.000
% 1.98/0.84 % Success case prop preproc time : 0.000
% 1.98/0.84 % Success case prop encoding time : 0.000
% 1.98/0.84 % Success case prop solver time : 0.000
% 1.98/0.84 % Current number of processed clauses : 931
% 1.98/0.84 % Positive orientable unit clauses : 97
% 1.98/0.84 % Positive unorientable unit clauses: 0
% 1.98/0.84 % Negative unit clauses : 14
% 1.98/0.84 % Non-unit-clauses : 820
% 1.98/0.84 % Current number of unprocessed clauses: 9716
% 1.98/0.84 % ...number of literals in the above : 27767
% 1.98/0.84 % Current number of archived formulas : 0
% 1.98/0.84 % Current number of archived clauses : 78
% 1.98/0.84 % Clause-clause subsumption calls (NU) : 81586
% 1.98/0.84 % Rec. Clause-clause subsumption calls : 63171
% 1.98/0.84 % Non-unit clause-clause subsumptions : 677
% 1.98/0.84 % Unit Clause-clause subsumption calls : 10093
% 1.98/0.84 % Rewrite failures with RHS unbound : 0
% 1.98/0.84 % BW rewrite match attempts : 120
% 1.98/0.84 % BW rewrite match successes : 22
% 1.98/0.84 % Condensation attempts : 0
% 1.98/0.84 % Condensation successes : 0
% 1.98/0.84 % Termbank termtop insertions : 149081
% 1.98/0.84 % Search garbage collected termcells : 316
% 1.98/0.84
% 1.98/0.84 % -------------------------------------------------
% 1.98/0.84 % User time : 0.334 s
% 1.98/0.84 % System time : 0.021 s
% 1.98/0.84 % Total time : 0.355 s
% 1.98/0.84 % Maximum resident set size: 3512 pages
% 1.98/0.84
% 1.98/0.84 % -------------------------------------------------
% 1.98/0.84 % User time : 1.615 s
% 1.98/0.84 % System time : 0.148 s
% 1.98/0.84 % Total time : 1.763 s
% 1.98/0.84 % Maximum resident set size: 4608 pages
% 1.98/0.84 % E exiting
%------------------------------------------------------------------------------