%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV228+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:54:00 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 347 ( 261 equ)
% Maximal formula atoms : 75 ( 14 avg)
% Number of connectives : 497 ( 174 ~; 52 |; 253 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 34 ( 3 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0681,conjecture,
( ( ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) ) )
=> ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> ( ( n3 = X22
& n3 = X21
& n0 = X22
& ~ ( n5 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n4 = X22 )
& ~ ( n5 = X22
& n4 = X21 )
& ~ ( n4 = X22
& n4 = X21 )
& ~ ( n5 = X21
& n3 = X22 )
& ~ ( n4 = X21
& n3 = X22 )
& ~ ( n5 = X22
& n3 = X21 )
& ~ ( n4 = X22
& n3 = X21 )
& ~ ( n3 = X22
& n3 = X21 )
& ~ ( n5 = X21
& n2 = X22 )
& ~ ( n4 = X21
& n2 = X22 )
& ~ ( n3 = X21
& n2 = X22 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n4 = X21
& n1 = X22 )
& ~ ( n3 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n4 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 ) )
=> n0 = a_select2(xinit_noise,n3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0681) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_3_0,axiom,
gt(n3,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_3_0) ).
fof(c_0_3,plain,
! [X21,X22] :
( epred2_2(X22,X21)
<=> ( n3 = X22
& n3 = X21
& n0 = X22
& ~ ( n5 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n4 = X22 )
& ~ ( n5 = X22
& n4 = X21 )
& ~ ( n4 = X22
& n4 = X21 )
& ~ ( n5 = X21
& n3 = X22 )
& ~ ( n4 = X21
& n3 = X22 )
& ~ ( n5 = X22
& n3 = X21 )
& ~ ( n4 = X22
& n3 = X21 )
& ~ ( n3 = X22
& n3 = X21 )
& ~ ( n5 = X21
& n2 = X22 )
& ~ ( n4 = X21
& n2 = X22 )
& ~ ( n3 = X21
& n2 = X22 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n4 = X21
& n1 = X22 )
& ~ ( n3 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n4 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ( ( ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) ) )
=> ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> ( ( n3 = X22
& n3 = X21
& n0 = X22
& ~ ( n5 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n4 = X22 )
& ~ ( n5 = X22
& n4 = X21 )
& ~ ( n4 = X22
& n4 = X21 )
& ~ ( n5 = X21
& n3 = X22 )
& ~ ( n4 = X21
& n3 = X22 )
& ~ ( n5 = X22
& n3 = X21 )
& ~ ( n4 = X22
& n3 = X21 )
& ~ ( n3 = X22
& n3 = X21 )
& ~ ( n5 = X21
& n2 = X22 )
& ~ ( n4 = X21
& n2 = X22 )
& ~ ( n3 = X21
& n2 = X22 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n4 = X21
& n1 = X22 )
& ~ ( n3 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n4 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 ) )
=> n0 = a_select2(xinit_noise,n3) ) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0681]) ).
fof(c_0_5,plain,
( epred1_0
<=> ( ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) ) ) ),
introduced(definition) ).
fof(c_0_6,plain,
! [X21,X22] :
( epred2_2(X22,X21)
=> ( n3 = X22
& n3 = X21
& n0 = X22
& ~ ( n5 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n4 = X22 )
& ~ ( n5 = X22
& n4 = X21 )
& ~ ( n4 = X22
& n4 = X21 )
& ~ ( n5 = X21
& n3 = X22 )
& ~ ( n4 = X21
& n3 = X22 )
& ~ ( n5 = X22
& n3 = X21 )
& ~ ( n4 = X22
& n3 = X21 )
& ~ ( n3 = X22
& n3 = X21 )
& ~ ( n5 = X21
& n2 = X22 )
& ~ ( n4 = X21
& n2 = X22 )
& ~ ( n3 = X21
& n2 = X22 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n4 = X21
& n1 = X22 )
& ~ ( n3 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n4 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
~ ( epred1_0
=> ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> ( epred2_2(X22,X21)
=> n0 = a_select2(xinit_noise,n3) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4,c_0_5]),c_0_3]) ).
fof(c_0_8,plain,
! [X73,X74] :
( ( ~ epred2_2(X74,X73)
| n3 = X74 )
& ( ~ epred2_2(X74,X73)
| n3 = X73 )
& ( ~ epred2_2(X74,X73)
| n0 = X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n5 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n4 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n4 != X73 )
& ( ~ epred2_2(X74,X73)
| n4 != X74
| n4 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n3 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n3 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n3 != X73 )
& ( ~ epred2_2(X74,X73)
| n4 != X74
| n3 != X73 )
& ( ~ epred2_2(X74,X73)
| n3 != X74
| n3 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n2 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n2 != X74 )
& ( ~ epred2_2(X74,X73)
| n3 != X73
| n2 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n2 != X73 )
& ( ~ epred2_2(X74,X73)
| n4 != X74
| n2 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n1 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n1 != X74 )
& ( ~ epred2_2(X74,X73)
| n3 != X73
| n1 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n1 != X73 )
& ( ~ epred2_2(X74,X73)
| n4 != X74
| n1 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n0 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n0 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n0 != X73 )
& ( ~ epred2_2(X74,X73)
| n4 != X74
| n0 != X73 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,negated_conjecture,
( n0 != a_select2(xinit_noise,n3)
& epred2_2(esk2_0,esk1_0)
& leq(esk2_0,n5)
& leq(esk1_0,n5)
& leq(n0,esk2_0)
& leq(n0,esk1_0)
& epred1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( ~ epred2_2(X1,X2)
| n0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
epred2_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = n0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( ~ epred2_2(X2,X1)
| n3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
epred2_2(n0,esk1_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = n3,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_16,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_17,plain,
( ~ epred2_2(X1,X2)
| n3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
epred2_2(n0,n3),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X68] : ~ gt(X68,X68),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_20,plain,
gt(n3,n0),
inference(split_conjunct,[status(thm)],[gt_3_0]) ).
cnf(c_0_21,negated_conjecture,
n3 = n0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV228+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:35:05 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % new_bool_3 with pid 2727870 completed with status 0
% 0.15/0.45 % Result found by new_bool_3
% 0.15/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 2727875 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.45 % Preprocessing time : 0.002 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 85
% 0.15/0.45 % Removed by relevancy pruning/SinE : 29
% 0.15/0.45 % Initial clauses : 92
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 92
% 0.15/0.45 % Processed clauses : 49
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 0
% 0.15/0.45 % ...remaining for further processing : 49
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 20
% 0.15/0.45 % Generated clauses : 8
% 0.15/0.45 % ...of the previous two non-redundant : 16
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 0
% 0.15/0.45 % Paramodulations : 8
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 36
% 0.15/0.45 % ...of those cached : 22
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 29
% 0.15/0.45 % Positive orientable unit clauses : 27
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 1
% 0.15/0.45 % Non-unit-clauses : 1
% 0.15/0.45 % Current number of unprocessed clauses: 51
% 0.15/0.45 % ...number of literals in the above : 149
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 20
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 4
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 4
% 0.15/0.45 % Non-unit clause-clause subsumptions : 0
% 0.15/0.45 % Unit Clause-clause subsumption calls : 3
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 7
% 0.15/0.45 % BW rewrite match successes : 3
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 5126
% 0.15/0.45 % Search garbage collected termcells : 974
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.008 s
% 0.15/0.45 % System time : 0.002 s
% 0.15/0.45 % Total time : 0.010 s
% 0.15/0.45 % Maximum resident set size: 3700 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.012 s
% 0.15/0.45 % System time : 0.007 s
% 0.15/0.45 % Total time : 0.019 s
% 0.15/0.45 % Maximum resident set size: 4864 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------