%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET241-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:58 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 2 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 31 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(cartesian_product2,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(prove_restriction_alternate_defn4_1,negated_conjecture,
member(ordered_pair(u,v),restrict(xr,x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restriction_alternate_defn4_1) ).
cnf(prove_restriction_alternate_defn4_2,negated_conjecture,
~ member(v,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restriction_alternate_defn4_2) ).
cnf(c_0_5,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_6,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_5 ).
cnf(c_0_7,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_8,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
inference(fof_simplification,[status(thm)],[cartesian_product2]) ).
cnf(c_0_9,plain,
( ~ member(X1,restrict(X4,X2,X3))
| member(X1,cross_product(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
member(ordered_pair(u,v),restrict(xr,x,y)),
prove_restriction_alternate_defn4_1 ).
cnf(c_0_11,negated_conjecture,
~ member(v,y),
inference(fof_simplification,[status(thm)],[prove_restriction_alternate_defn4_2]) ).
cnf(c_0_12,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
member(ordered_pair(u,v),cross_product(x,y)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ member(v,y),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET241-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % 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 05:03:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % new_bool_3 with pid 903097 completed with status 0
% 0.15/0.46 % Result found by new_bool_3
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % SubtermCWHack with pid 903101 completed with status 0
% 0.15/0.46 % Result found by SubtermCWHack
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % Preprocessing time : 0.002 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Unsatisfiable
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 114
% 0.15/0.46 % Removed by relevancy pruning/SinE : 79
% 0.15/0.46 % Initial clauses : 35
% 0.15/0.46 % Removed in clause preprocessing : 0
% 0.15/0.46 % Initial clauses in saturation : 35
% 0.15/0.46 % Processed clauses : 52
% 0.15/0.46 % ...of these trivial : 0
% 0.15/0.46 % ...subsumed : 3
% 0.15/0.46 % ...remaining for further processing : 49
% 0.15/0.46 % Other redundant clauses eliminated : 2
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 0
% 0.15/0.46 % Backward-rewritten : 0
% 0.15/0.46 % Generated clauses : 61
% 0.15/0.46 % ...of the previous two non-redundant : 50
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 0
% 0.15/0.46 % Paramodulations : 59
% 0.15/0.46 % Factorizations : 0
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 2
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 6
% 0.15/0.46 % ...of those cached : 4
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 47
% 0.15/0.46 % Positive orientable unit clauses : 11
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 1
% 0.15/0.46 % Non-unit-clauses : 35
% 0.15/0.46 % Current number of unprocessed clauses: 31
% 0.15/0.46 % ...number of literals in the above : 87
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 0
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 184
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 171
% 0.15/0.46 % Non-unit clause-clause subsumptions : 3
% 0.15/0.46 % Unit Clause-clause subsumption calls : 2
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 1
% 0.15/0.46 % BW rewrite match successes : 0
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 2368
% 0.15/0.46 % Search garbage collected termcells : 429
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.007 s
% 0.15/0.46 % System time : 0.002 s
% 0.15/0.46 % Total time : 0.009 s
% 0.15/0.46 % Maximum resident set size: 3744 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.013 s
% 0.15/0.46 % System time : 0.009 s
% 0.15/0.46 % Total time : 0.022 s
% 0.15/0.46 % Maximum resident set size: 4864 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------