%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV216+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 : n020.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:53:58 PM UTC 2026
% Result : Theorem 0.15s 0.61s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 316 ( 258 equ)
% Maximal formula atoms : 77 ( 15 avg)
% Number of connectives : 470 ( 174 ~; 52 |; 236 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 10 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 20 ( 2 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0201,conjecture,
! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> ( ( n4 = X14
& n2 = X18
& n2 = X14
& n1 = X18
& ~ ( n5 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n4 = X18 )
& ~ ( n5 = X18
& n4 = X14 )
& ~ ( n4 = X18
& n4 = X14 )
& ~ ( n5 = X14
& n3 = X18 )
& ~ ( n4 = X14
& n3 = X18 )
& ~ ( n5 = X18
& n3 = X14 )
& ~ ( n4 = X18
& n3 = X14 )
& ~ ( n3 = X18
& n3 = X14 )
& ~ ( n5 = X14
& n2 = X18 )
& ~ ( n4 = X14
& n2 = X18 )
& ~ ( n3 = X14
& n2 = X18 )
& ~ ( n5 = X18
& n2 = X14 )
& ~ ( n4 = X18
& n2 = X14 )
& ~ ( n3 = X18
& n2 = X14 )
& ~ ( n5 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n3 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = X18
& n0 = X14 )
& ~ ( n3 = X18
& n0 = X14 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0201) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_2_1,axiom,
gt(n2,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_2_1) ).
fof(c_0_3,plain,
! [X18,X14] :
( epred1_2(X14,X18)
<=> ( n4 = X14
& n2 = X18
& n2 = X14
& n1 = X18
& ~ ( n5 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n4 = X18 )
& ~ ( n5 = X18
& n4 = X14 )
& ~ ( n4 = X18
& n4 = X14 )
& ~ ( n5 = X14
& n3 = X18 )
& ~ ( n4 = X14
& n3 = X18 )
& ~ ( n5 = X18
& n3 = X14 )
& ~ ( n4 = X18
& n3 = X14 )
& ~ ( n3 = X18
& n3 = X14 )
& ~ ( n5 = X14
& n2 = X18 )
& ~ ( n4 = X14
& n2 = X18 )
& ~ ( n3 = X14
& n2 = X18 )
& ~ ( n5 = X18
& n2 = X14 )
& ~ ( n4 = X18
& n2 = X14 )
& ~ ( n3 = X18
& n2 = X14 )
& ~ ( n5 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n3 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = X18
& n0 = X14 )
& ~ ( n3 = X18
& n0 = X14 ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> ( ( n4 = X14
& n2 = X18
& n2 = X14
& n1 = X18
& ~ ( n5 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n4 = X18 )
& ~ ( n5 = X18
& n4 = X14 )
& ~ ( n4 = X18
& n4 = X14 )
& ~ ( n5 = X14
& n3 = X18 )
& ~ ( n4 = X14
& n3 = X18 )
& ~ ( n5 = X18
& n3 = X14 )
& ~ ( n4 = X18
& n3 = X14 )
& ~ ( n3 = X18
& n3 = X14 )
& ~ ( n5 = X14
& n2 = X18 )
& ~ ( n4 = X14
& n2 = X18 )
& ~ ( n3 = X14
& n2 = X18 )
& ~ ( n5 = X18
& n2 = X14 )
& ~ ( n4 = X18
& n2 = X14 )
& ~ ( n3 = X18
& n2 = X14 )
& ~ ( n5 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n3 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = X18
& n0 = X14 )
& ~ ( n3 = X18
& n0 = X14 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0201]) ).
fof(c_0_5,plain,
! [X18,X14] :
( epred1_2(X14,X18)
=> ( n4 = X14
& n2 = X18
& n2 = X14
& n1 = X18
& ~ ( n5 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n4 = X18 )
& ~ ( n5 = X18
& n4 = X14 )
& ~ ( n4 = X18
& n4 = X14 )
& ~ ( n5 = X14
& n3 = X18 )
& ~ ( n4 = X14
& n3 = X18 )
& ~ ( n5 = X18
& n3 = X14 )
& ~ ( n4 = X18
& n3 = X14 )
& ~ ( n3 = X18
& n3 = X14 )
& ~ ( n5 = X14
& n2 = X18 )
& ~ ( n4 = X14
& n2 = X18 )
& ~ ( n3 = X14
& n2 = X18 )
& ~ ( n5 = X18
& n2 = X14 )
& ~ ( n4 = X18
& n2 = X14 )
& ~ ( n3 = X18
& n2 = X14 )
& ~ ( n5 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n3 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = X18
& n0 = X14 )
& ~ ( n3 = X18
& n0 = X14 ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
~ ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> ( epred1_2(X14,X18)
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_3]) ).
fof(c_0_7,plain,
! [X69,X70] :
( ( ~ epred1_2(X70,X69)
| n4 = X70 )
& ( ~ epred1_2(X70,X69)
| n2 = X69 )
& ( ~ epred1_2(X70,X69)
| n2 = X70 )
& ( ~ epred1_2(X70,X69)
| n1 = X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n5 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n4 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n4 != X70 )
& ( ~ epred1_2(X70,X69)
| n4 != X69
| n4 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n3 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n3 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n3 != X70 )
& ( ~ epred1_2(X70,X69)
| n4 != X69
| n3 != X70 )
& ( ~ epred1_2(X70,X69)
| n3 != X69
| n3 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n2 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n2 != X69 )
& ( ~ epred1_2(X70,X69)
| n3 != X70
| n2 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n2 != X70 )
& ( ~ epred1_2(X70,X69)
| n4 != X69
| n2 != X70 )
& ( ~ epred1_2(X70,X69)
| n3 != X69
| n2 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n1 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n1 != X70 )
& ( ~ epred1_2(X70,X69)
| n4 != X69
| n1 != X70 )
& ( ~ epred1_2(X70,X69)
| n3 != X69
| n1 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n0 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n0 != X70 )
& ( ~ epred1_2(X70,X69)
| n4 != X69
| n0 != X70 )
& ( ~ epred1_2(X70,X69)
| n3 != X69
| n0 != X70 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,negated_conjecture,
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& epred1_2(esk1_0,esk2_0)
& leq(esk2_0,n5)
& leq(esk1_0,n5)
& leq(n0,esk2_0)
& leq(n0,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,plain,
( ~ epred1_2(X2,X1)
| n1 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = n1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_12,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_13,plain,
( ~ epred1_2(X2,X1)
| n2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
epred1_2(esk1_0,n1),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,plain,
! [X68] : ~ gt(X68,X68),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
cnf(c_0_16,plain,
gt(n2,n1),
inference(split_conjunct,[status(thm)],[gt_2_1]) ).
cnf(c_0_17,negated_conjecture,
n1 = n2,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV216+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.11/0.53 % Computer : n020.cluster.edu
% 0.11/0.53 % Model : x86_64 x86_64
% 0.11/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.53 % Memory : 8046.5625MB
% 0.11/0.53 % OS : Linux 6.8.0-71-generic
% 0.11/0.53 % CPULimit : 300
% 0.11/0.53 % WCLimit : 300
% 0.11/0.53 % DateTime : Mon Sep 21 08:35:48 UTC 2026
% 0.11/0.54 % CPUTime :
% 0.11/0.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.58 Running first-order theorem proving
% 0.15/0.58 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.61 % Version: 3.5.1
% 0.15/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 % Starting sh5l with 300s (1) cores
% 0.15/0.61 % new_bool_1 with pid 2509032 completed with status 0
% 0.15/0.61 % Result found by new_bool_1
% 0.15/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.61 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.15/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.61 % SubtermCWHack with pid 2509035 completed with status 0
% 0.15/0.61 % Result found by SubtermCWHack
% 0.15/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.61 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.15/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.61 % Preprocessing time : 0.001 s
% 0.15/0.61
% 0.15/0.61 % Proof found!
% 0.15/0.61 % SZS status Theorem
% 0.15/0.61 % SZS output start CNFRefutation
% See solution above
% 0.15/0.61 % Parsed axioms : 92
% 0.15/0.61 % Removed by relevancy pruning/SinE : 29
% 0.15/0.61 % Initial clauses : 97
% 0.15/0.61 % Removed in clause preprocessing : 0
% 0.15/0.61 % Initial clauses in saturation : 97
% 0.15/0.61 % Processed clauses : 50
% 0.15/0.61 % ...of these trivial : 0
% 0.15/0.61 % ...subsumed : 0
% 0.15/0.61 % ...remaining for further processing : 50
% 0.15/0.61 % Other redundant clauses eliminated : 0
% 0.15/0.61 % Clauses deleted for lack of memory : 0
% 0.15/0.61 % Backward-subsumed : 0
% 0.15/0.61 % Backward-rewritten : 19
% 0.15/0.61 % Generated clauses : 7
% 0.15/0.61 % ...of the previous two non-redundant : 12
% 0.15/0.61 % ...aggressively subsumed : 0
% 0.15/0.61 % Contextual simplify-reflections : 0
% 0.15/0.61 % Paramodulations : 7
% 0.15/0.61 % Factorizations : 0
% 0.15/0.61 % NegExts : 0
% 0.15/0.61 % Equation resolutions : 0
% 0.15/0.61 % Disequality decompositions : 0
% 0.15/0.61 % Total rewrite steps : 30
% 0.15/0.61 % ...of those cached : 17
% 0.15/0.61 % Propositional unsat checks : 0
% 0.15/0.61 % Propositional check models : 0
% 0.15/0.61 % Propositional check unsatisfiable : 0
% 0.15/0.61 % Propositional clauses : 0
% 0.15/0.61 % Propositional clauses after purity: 0
% 0.15/0.61 % Propositional unsat core size : 0
% 0.15/0.61 % Propositional preprocessing time : 0.000
% 0.15/0.61 % Propositional encoding time : 0.000
% 0.15/0.61 % Propositional solver time : 0.000
% 0.15/0.61 % Success case prop preproc time : 0.000
% 0.15/0.61 % Success case prop encoding time : 0.000
% 0.15/0.61 % Success case prop solver time : 0.000
% 0.15/0.61 % Current number of processed clauses : 31
% 0.15/0.61 % Positive orientable unit clauses : 29
% 0.15/0.61 % Positive unorientable unit clauses: 0
% 0.15/0.61 % Negative unit clauses : 1
% 0.15/0.61 % Non-unit-clauses : 1
% 0.15/0.61 % Current number of unprocessed clauses: 52
% 0.15/0.61 % ...number of literals in the above : 142
% 0.15/0.61 % Current number of archived formulas : 0
% 0.15/0.61 % Current number of archived clauses : 19
% 0.15/0.61 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.61 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.61 % Non-unit clause-clause subsumptions : 0
% 0.15/0.61 % Unit Clause-clause subsumption calls : 0
% 0.15/0.61 % Rewrite failures with RHS unbound : 0
% 0.15/0.61 % BW rewrite match attempts : 6
% 0.15/0.61 % BW rewrite match successes : 2
% 0.15/0.61 % Condensation attempts : 0
% 0.15/0.61 % Condensation successes : 0
% 0.15/0.61 % Termbank termtop insertions : 4868
% 0.15/0.61 % Search garbage collected termcells : 878
% 0.15/0.61
% 0.15/0.61 % -------------------------------------------------
% 0.15/0.61 % User time : 0.005 s
% 0.15/0.61 % System time : 0.002 s
% 0.15/0.61 % Total time : 0.007 s
% 0.15/0.61 % Maximum resident set size: 4008 pages
% 0.15/0.61
% 0.15/0.61 % -------------------------------------------------
% 0.15/0.61 % User time : 0.007 s
% 0.15/0.61 % System time : 0.008 s
% 0.15/0.61 % Total time : 0.015 s
% 0.15/0.61 % Maximum resident set size: 4608 pages
% 0.15/0.61 % E exiting
%------------------------------------------------------------------------------