%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV104+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 : n012.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:44 PM UTC 2026
% Result : Theorem 0.04s 10.40s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 18 unt; 0 def)
% Number of atoms : 89 ( 78 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 84 ( 28 ~; 24 |; 28 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 37 ( 3 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0016,conjecture,
( ( a_select2(xinit_defuse,n5) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use )
=> ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_inuse_0016) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_5_4,axiom,
gt(n5,n4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_4) ).
fof(gt_5_3,axiom,
gt(n5,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_3) ).
fof(gt_4_3,axiom,
gt(n4,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_3) ).
fof(c_0_7,negated_conjecture,
~ ( ( a_select2(xinit_defuse,n5) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use )
=> ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0016]) ).
fof(c_0_8,negated_conjecture,
( ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use )
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_9,plain,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
inference(fof_simplification,[status(thm)],[sel2_update_2]) ).
cnf(c_0_10,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X173,X174,X175] : a_select2(tptp_update2(X173,X174,X175),X174) = X175,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_15,plain,
! [X176,X177,X178,X179,X180] :
( a_select2(tptp_update2(X178,X176,X180),X177) = X179
| a_select2(X178,X177) != X179
| X176 = X177 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_16,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( a_select2(X3,X2) != X4
| a_select2(tptp_update2(X3,X1,X5),X2) = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,plain,
( X2 = X4
| a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| n5 = n4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]) ).
fof(c_0_22,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_23,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use
| n5 = n4
| n5 = n3 ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
fof(c_0_24,plain,
! [X33] : ~ gt(X33,X33),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_25,plain,
gt(n5,n4),
inference(split_conjunct,[status(thm)],[gt_5_4]) ).
cnf(c_0_26,negated_conjecture,
( n5 = n3
| n5 = n4
| n4 = n3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_17])]) ).
cnf(c_0_27,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
gt(n5,n3),
inference(split_conjunct,[status(thm)],[gt_5_3]) ).
cnf(c_0_29,negated_conjecture,
( n4 = n3
| n5 = n3 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
gt(n4,n3),
inference(split_conjunct,[status(thm)],[gt_4_3]) ).
cnf(c_0_31,negated_conjecture,
n4 = n3,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV104+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/10.33 % Computer : n012.cluster.edu
% 0.04/10.33 % Model : x86_64 x86_64
% 0.04/10.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/10.33 % Memory : 8046.5625MB
% 0.04/10.33 % OS : Linux 6.8.0-71-generic
% 0.04/10.33 % CPULimit : 300
% 0.04/10.33 % WCLimit : 300
% 0.04/10.33 % DateTime : Mon Sep 21 08:31:00 UTC 2026
% 0.04/10.33 % CPUTime :
% 0.04/10.33 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/10.36 Running first-order theorem proving
% 0.04/10.36 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.04/10.40 % Version: 3.5.1
% 0.04/10.40 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.04/10.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/10.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.04/10.40 % Starting new_bool_3 with 300s (1) cores
% 0.04/10.40 % Starting new_bool_1 with 300s (1) cores
% 0.04/10.40 % Starting sh5l with 300s (1) cores
% 0.04/10.40 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1992237 completed with status 0
% 0.04/10.40 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.04/10.40 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.04/10.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/10.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.04/10.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/10.40 % No SInE strategy applied
% 0.04/10.40 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.04/10.40 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/10.40 % Starting SubtermCWHack with 136s (1) cores
% 0.04/10.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.04/10.40 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.04/10.40 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.04/10.40 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.04/10.40 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1992245 completed with status 0
% 0.04/10.40 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.04/10.40 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.04/10.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/10.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.04/10.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/10.40 % No SInE strategy applied
% 0.04/10.40 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.04/10.40 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/10.40 % Starting SubtermCWHack with 136s (1) cores
% 0.04/10.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.04/10.40 % Preprocessing time : 0.003 s
% 0.04/10.40 % Presaturation interreduction done
% 0.04/10.40
% 0.04/10.40 % Proof found!
% 0.04/10.40 % SZS status Theorem
% 0.04/10.40 % SZS output start CNFRefutation
% See solution above
% 0.04/10.40 % Parsed axioms : 85
% 0.04/10.40 % Removed by relevancy pruning/SinE : 0
% 0.04/10.40 % Initial clauses : 199
% 0.04/10.40 % Removed in clause preprocessing : 2
% 0.04/10.40 % Initial clauses in saturation : 197
% 0.04/10.40 % Processed clauses : 304
% 0.08/10.40 % ...of these trivial : 0
% 0.08/10.40 % ...subsumed : 0
% 0.08/10.40 % ...remaining for further processing : 304
% 0.08/10.40 % Other redundant clauses eliminated : 3
% 0.08/10.40 % Clauses deleted for lack of memory : 0
% 0.08/10.40 % Backward-subsumed : 1
% 0.08/10.40 % Backward-rewritten : 22
% 0.08/10.40 % Generated clauses : 197
% 0.08/10.40 % ...of the previous two non-redundant : 162
% 0.08/10.40 % ...aggressively subsumed : 0
% 0.08/10.40 % Contextual simplify-reflections : 0
% 0.08/10.40 % Paramodulations : 192
% 0.08/10.40 % Factorizations : 3
% 0.08/10.40 % NegExts : 0
% 0.08/10.40 % Equation resolutions : 3
% 0.08/10.40 % Disequality decompositions : 0
% 0.08/10.40 % Total rewrite steps : 148
% 0.08/10.40 % ...of those cached : 89
% 0.08/10.40 % Propositional unsat checks : 0
% 0.08/10.40 % Propositional check models : 0
% 0.08/10.40 % Propositional check unsatisfiable : 0
% 0.08/10.40 % Propositional clauses : 0
% 0.08/10.40 % Propositional clauses after purity: 0
% 0.08/10.40 % Propositional unsat core size : 0
% 0.08/10.40 % Propositional preprocessing time : 0.000
% 0.08/10.40 % Propositional encoding time : 0.000
% 0.08/10.40 % Propositional solver time : 0.000
% 0.08/10.40 % Success case prop preproc time : 0.000
% 0.08/10.40 % Success case prop encoding time : 0.000
% 0.08/10.40 % Success case prop solver time : 0.000
% 0.08/10.40 % Current number of processed clauses : 82
% 0.08/10.40 % Positive orientable unit clauses : 54
% 0.08/10.40 % Positive unorientable unit clauses: 1
% 0.08/10.40 % Negative unit clauses : 2
% 0.08/10.40 % Non-unit-clauses : 25
% 0.08/10.40 % Current number of unprocessed clauses: 246
% 0.08/10.40 % ...number of literals in the above : 954
% 0.08/10.40 % Current number of archived formulas : 0
% 0.08/10.40 % Current number of archived clauses : 222
% 0.08/10.40 % Clause-clause subsumption calls (NU) : 15171
% 0.08/10.40 % Rec. Clause-clause subsumption calls : 1405
% 0.08/10.40 % Non-unit clause-clause subsumptions : 1
% 0.08/10.40 % Unit Clause-clause subsumption calls : 242
% 0.08/10.40 % Rewrite failures with RHS unbound : 0
% 0.08/10.40 % BW rewrite match attempts : 29
% 0.08/10.40 % BW rewrite match successes : 24
% 0.08/10.40 % Condensation attempts : 0
% 0.08/10.40 % Condensation successes : 0
% 0.08/10.40 % Termbank termtop insertions : 19151
% 0.08/10.40 % Search garbage collected termcells : 2206
% 0.08/10.40
% 0.08/10.40 % -------------------------------------------------
% 0.08/10.40 % User time : 0.024 s
% 0.08/10.40 % System time : 0.004 s
% 0.08/10.40 % Total time : 0.028 s
% 0.08/10.40 % Maximum resident set size: 3996 pages
% 0.08/10.40
% 0.08/10.40 % -------------------------------------------------
% 0.08/10.40 % User time : 0.094 s
% 0.08/10.40 % System time : 0.020 s
% 0.08/10.40 % Total time : 0.115 s
% 0.08/10.40 % Maximum resident set size: 4608 pages
% 0.08/10.40 % E exiting
%------------------------------------------------------------------------------