%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV217+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 : 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:59 PM UTC 2026
% Result : Theorem 0.23s 0.46s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 336 ( 275 equ)
% Maximal formula atoms : 81 ( 14 avg)
% Number of connectives : 501 ( 188 ~; 56 |; 249 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 9 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 : 22 ( 3 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0241,conjecture,
! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> ( ( n3 = X18
& n2 = X18
& n2 = X14
& ~ ( 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 )
& ~ ( n4 = X14
& n1 = X18 )
& ~ ( n3 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n4 = X14
& n0 = X18 )
& ~ ( n3 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = X18
& n0 = X14 ) )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0241) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_3_2,axiom,
gt(n3,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_3_2) ).
fof(c_0_3,plain,
! [X14,X18] :
( epred1_2(X18,X14)
<=> ( n3 = X18
& n2 = X18
& n2 = X14
& ~ ( 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 )
& ~ ( n4 = X14
& n1 = X18 )
& ~ ( n3 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n4 = X14
& n0 = X18 )
& ~ ( n3 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = 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) )
=> ( ( n3 = X18
& n2 = X18
& n2 = X14
& ~ ( 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 )
& ~ ( n4 = X14
& n1 = X18 )
& ~ ( n3 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n4 = X14
& n0 = X18 )
& ~ ( n3 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = X18
& n0 = X14 ) )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0241]) ).
fof(c_0_5,plain,
! [X14,X18] :
( epred1_2(X18,X14)
=> ( n3 = X18
& n2 = X18
& n2 = X14
& ~ ( 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 )
& ~ ( n4 = X14
& n1 = X18 )
& ~ ( n3 = X14
& n1 = X18 )
& ~ ( n5 = X18
& n1 = X14 )
& ~ ( n4 = X18
& n1 = X14 )
& ~ ( n5 = X14
& n0 = X18 )
& ~ ( n4 = X14
& n0 = X18 )
& ~ ( n3 = X14
& n0 = X18 )
& ~ ( n5 = X18
& n0 = X14 )
& ~ ( n4 = 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(X18,X14)
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_3]) ).
fof(c_0_7,plain,
! [X69,X70] :
( ( ~ epred1_2(X70,X69)
| n3 = X70 )
& ( ~ epred1_2(X70,X69)
| n2 = X70 )
& ( ~ epred1_2(X70,X69)
| n2 = X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n5 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n4 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n4 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n4 != X69 )
& ( ~ epred1_2(X70,X69)
| n5 != X69
| n3 != X70 )
& ( ~ epred1_2(X70,X69)
| n4 != X69
| n3 != X70 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n3 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n3 != X69 )
& ( ~ epred1_2(X70,X69)
| n3 != X70
| n3 != 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
| n2 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n2 != X69 )
& ( ~ epred1_2(X70,X69)
| n3 != X70
| n2 != 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
| n1 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n1 != 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 )
& ( ~ epred1_2(X70,X69)
| n5 != X70
| n0 != X69 )
& ( ~ epred1_2(X70,X69)
| n4 != X70
| n0 != X69 ) ),
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,
( times(divide(n1,n400),a_select2(sigma,n2)) != n0
& epred1_2(esk2_0,esk1_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)
| n2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
epred1_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = n2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( ~ epred1_2(X1,X2)
| n2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
epred1_2(esk2_0,n2),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = n2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_15,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_16,plain,
( ~ epred1_2(X1,X2)
| n3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
epred1_2(n2,n2),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
! [X68] : ~ gt(X68,X68),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_19,plain,
gt(n3,n2),
inference(split_conjunct,[status(thm)],[gt_3_2]) ).
cnf(c_0_20,negated_conjecture,
n2 = n3,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV217+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.11/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % 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 08:36:02 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/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.23/0.46 % Version: 3.5.1
% 0.23/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.46 % Starting sh5l with 300s (1) cores
% 0.23/0.46 % new_bool_1 with pid 2509897 completed with status 0
% 0.23/0.46 % Result found by new_bool_1
% 0.23/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.46 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.23/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.46 % SubtermCWHack with pid 2509901 completed with status 0
% 0.23/0.46 % Result found by SubtermCWHack
% 0.23/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.46 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.23/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.46 % Preprocessing time : 0.002 s
% 0.23/0.46
% 0.23/0.46 % Proof found!
% 0.23/0.46 % SZS status Theorem
% 0.23/0.46 % SZS output start CNFRefutation
% See solution above
% 0.23/0.46 % Parsed axioms : 92
% 0.23/0.46 % Removed by relevancy pruning/SinE : 29
% 0.23/0.46 % Initial clauses : 98
% 0.23/0.46 % Removed in clause preprocessing : 0
% 0.23/0.46 % Initial clauses in saturation : 98
% 0.23/0.46 % Processed clauses : 53
% 0.23/0.46 % ...of these trivial : 0
% 0.23/0.46 % ...subsumed : 0
% 0.23/0.46 % ...remaining for further processing : 53
% 0.23/0.46 % Other redundant clauses eliminated : 0
% 0.23/0.46 % Clauses deleted for lack of memory : 0
% 0.23/0.46 % Backward-subsumed : 0
% 0.23/0.46 % Backward-rewritten : 23
% 0.23/0.46 % Generated clauses : 8
% 0.23/0.46 % ...of the previous two non-redundant : 16
% 0.23/0.46 % ...aggressively subsumed : 0
% 0.23/0.46 % Contextual simplify-reflections : 0
% 0.23/0.46 % Paramodulations : 8
% 0.23/0.46 % Factorizations : 0
% 0.23/0.46 % NegExts : 0
% 0.23/0.46 % Equation resolutions : 0
% 0.23/0.46 % Disequality decompositions : 0
% 0.23/0.46 % Total rewrite steps : 35
% 0.23/0.46 % ...of those cached : 20
% 0.23/0.46 % Propositional unsat checks : 0
% 0.23/0.46 % Propositional check models : 0
% 0.23/0.46 % Propositional check unsatisfiable : 0
% 0.23/0.46 % Propositional clauses : 0
% 0.23/0.46 % Propositional clauses after purity: 0
% 0.23/0.46 % Propositional unsat core size : 0
% 0.23/0.46 % Propositional preprocessing time : 0.000
% 0.23/0.46 % Propositional encoding time : 0.000
% 0.23/0.46 % Propositional solver time : 0.000
% 0.23/0.46 % Success case prop preproc time : 0.000
% 0.23/0.46 % Success case prop encoding time : 0.000
% 0.23/0.46 % Success case prop solver time : 0.000
% 0.23/0.46 % Current number of processed clauses : 30
% 0.23/0.46 % Positive orientable unit clauses : 28
% 0.23/0.46 % Positive unorientable unit clauses: 0
% 0.23/0.46 % Negative unit clauses : 1
% 0.23/0.46 % Non-unit-clauses : 1
% 0.23/0.46 % Current number of unprocessed clauses: 52
% 0.23/0.46 % ...number of literals in the above : 144
% 0.23/0.46 % Current number of archived formulas : 0
% 0.23/0.46 % Current number of archived clauses : 23
% 0.23/0.46 % Clause-clause subsumption calls (NU) : 2
% 0.23/0.46 % Rec. Clause-clause subsumption calls : 2
% 0.23/0.46 % Non-unit clause-clause subsumptions : 0
% 0.23/0.46 % Unit Clause-clause subsumption calls : 1
% 0.23/0.46 % Rewrite failures with RHS unbound : 0
% 0.23/0.46 % BW rewrite match attempts : 7
% 0.23/0.46 % BW rewrite match successes : 3
% 0.23/0.46 % Condensation attempts : 0
% 0.23/0.46 % Condensation successes : 0
% 0.23/0.46 % Termbank termtop insertions : 4970
% 0.23/0.46 % Search garbage collected termcells : 890
% 0.23/0.46
% 0.23/0.46 % -------------------------------------------------
% 0.23/0.46 % User time : 0.008 s
% 0.23/0.46 % System time : 0.001 s
% 0.23/0.46 % Total time : 0.009 s
% 0.23/0.46 % Maximum resident set size: 3752 pages
% 0.23/0.46
% 0.23/0.46 % -------------------------------------------------
% 0.23/0.46 % User time : 0.013 s
% 0.23/0.46 % System time : 0.005 s
% 0.23/0.46 % Total time : 0.017 s
% 0.23/0.46 % Maximum resident set size: 4608 pages
% 0.23/0.46 % E exiting
%------------------------------------------------------------------------------