%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV227+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 327 ( 244 equ)
% Maximal formula atoms : 71 ( 15 avg)
% Number of connectives : 466 ( 160 ~; 48 |; 240 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 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 : 32 ( 2 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0641,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) )
=> ( ( n5 = X21
& n4 = X22
& n4 = X21
& n2 = 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 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n3 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n3 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 )
& ~ ( n3 = X22
& n0 = X21 ) )
=> a_select2(xinit_noise,n4) = n0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0641) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_4_2,axiom,
gt(n4,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_4_2) ).
fof(c_0_3,plain,
! [X22,X21] :
( epred2_2(X21,X22)
<=> ( n5 = X21
& n4 = X22
& n4 = X21
& n2 = 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 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n3 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n3 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 )
& ~ ( n3 = 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) )
=> ( ( n5 = X21
& n4 = X22
& n4 = X21
& n2 = 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 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n3 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n3 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 )
& ~ ( n3 = X22
& n0 = X21 ) )
=> a_select2(xinit_noise,n4) = n0 ) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0641]) ).
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,
! [X22,X21] :
( epred2_2(X21,X22)
=> ( n5 = X21
& n4 = X22
& n4 = X21
& n2 = 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 )
& ~ ( n5 = X22
& n2 = X21 )
& ~ ( n4 = X22
& n2 = X21 )
& ~ ( n3 = X22
& n2 = X21 )
& ~ ( n5 = X21
& n1 = X22 )
& ~ ( n5 = X22
& n1 = X21 )
& ~ ( n4 = X22
& n1 = X21 )
& ~ ( n3 = X22
& n1 = X21 )
& ~ ( n5 = X21
& n0 = X22 )
& ~ ( n5 = X22
& n0 = X21 )
& ~ ( n4 = X22
& n0 = X21 )
& ~ ( n3 = 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(X21,X22)
=> a_select2(xinit_noise,n4) = n0 ) ) ),
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)
| n5 = X74 )
& ( ~ epred2_2(X74,X73)
| n4 = X73 )
& ( ~ epred2_2(X74,X73)
| n4 = X74 )
& ( ~ epred2_2(X74,X73)
| n2 = X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n5 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n4 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n4 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n4 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n3 != X73 )
& ( ~ epred2_2(X74,X73)
| n4 != X74
| n3 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n3 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n3 != X74 )
& ( ~ epred2_2(X74,X73)
| n3 != X73
| n3 != X74 )
& ( ~ epred2_2(X74,X73)
| n5 != X74
| n2 != 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
| n1 != 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
| n0 != X73 )
& ( ~ epred2_2(X74,X73)
| n5 != X73
| n0 != X74 )
& ( ~ epred2_2(X74,X73)
| n4 != X73
| n0 != X74 )
& ( ~ epred2_2(X74,X73)
| n3 != X73
| n0 != X74 ) ),
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,
( a_select2(xinit_noise,n4) != n0
& epred2_2(esk1_0,esk2_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(X2,X1)
| n2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
epred2_2(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = n2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_13,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_14,plain,
( ~ epred2_2(X2,X1)
| n4 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
epred2_2(esk1_0,n2),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X68] : ~ gt(X68,X68),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
cnf(c_0_17,plain,
gt(n4,n2),
inference(split_conjunct,[status(thm)],[gt_4_2]) ).
cnf(c_0_18,negated_conjecture,
n2 = n4,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV227+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n026.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 08:37:52 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % new_bool_3 with pid 1859267 completed with status 0
% 0.14/0.47 % Result found by new_bool_3
% 0.14/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.47 % SubtermCWHack with pid 1859270 completed with status 0
% 0.14/0.47 % Result found by SubtermCWHack
% 0.14/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.47 % Preprocessing time : 0.003 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Theorem
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 85
% 0.14/0.47 % Removed by relevancy pruning/SinE : 29
% 0.14/0.47 % Initial clauses : 91
% 0.14/0.47 % Removed in clause preprocessing : 0
% 0.14/0.47 % Initial clauses in saturation : 91
% 0.14/0.47 % Processed clauses : 45
% 0.14/0.47 % ...of these trivial : 0
% 0.14/0.47 % ...subsumed : 0
% 0.14/0.47 % ...remaining for further processing : 45
% 0.14/0.47 % Other redundant clauses eliminated : 0
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 0
% 0.14/0.47 % Backward-rewritten : 17
% 0.14/0.47 % Generated clauses : 7
% 0.14/0.47 % ...of the previous two non-redundant : 12
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 0
% 0.14/0.47 % Paramodulations : 7
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 0
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 23
% 0.14/0.47 % ...of those cached : 13
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 28
% 0.14/0.47 % Positive orientable unit clauses : 25
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 2
% 0.14/0.47 % Non-unit-clauses : 1
% 0.14/0.47 % Current number of unprocessed clauses: 51
% 0.14/0.47 % ...number of literals in the above : 147
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 17
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 2
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 2
% 0.14/0.47 % Non-unit clause-clause subsumptions : 0
% 0.14/0.47 % Unit Clause-clause subsumption calls : 1
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 6
% 0.14/0.47 % BW rewrite match successes : 2
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 5018
% 0.14/0.47 % Search garbage collected termcells : 962
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.010 s
% 0.14/0.47 % System time : 0.006 s
% 0.14/0.47 % Total time : 0.016 s
% 0.14/0.47 % Maximum resident set size: 4008 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.015 s
% 0.14/0.47 % System time : 0.014 s
% 0.14/0.47 % Total time : 0.029 s
% 0.14/0.47 % Maximum resident set size: 4864 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------