%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX186+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 06:59:46 PM UTC 2026
% Result : Theorem 7.02s 2.25s
% Output : CNFRefutation 7.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 6 RR)
% Number of literals : 15 ( 14 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
( X1 = X2
| drop(X3,X1) != drop(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_oo2l5p/input.p',i_0_9) ).
cnf(i_0_6,plain,
drop(s(X1),nil) = nil,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_oo2l5p/input.p',i_0_6) ).
cnf(i_0_7,plain,
drop(s(X1),cons(X2,X3)) = drop(X1,X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_oo2l5p/input.p',i_0_7) ).
cnf(i_0_3,plain,
cons(X1,X2) != nil,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6_oo2l5p/input.p',i_0_3) ).
cnf(c_0_14,negated_conjecture,
( X1 = X2
| drop(X3,X1) != drop(X3,X2) ),
i_0_9 ).
cnf(c_0_15,plain,
drop(s(X1),nil) = nil,
i_0_6 ).
cnf(c_0_16,negated_conjecture,
( nil = X1
| drop(s(X2),X1) != nil ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
drop(s(X1),cons(X2,X3)) = drop(X1,X3),
i_0_7 ).
cnf(c_0_18,negated_conjecture,
( cons(X1,X2) = nil
| drop(X3,X2) != nil ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
cons(X1,X2) != nil,
i_0_3 ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX186+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 09:35:30 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.02/2.25 # ENIGMATIC: Solved by autoschedule:
% 7.02/2.25 # No SInE strategy applied
% 7.02/2.25 # Trying AutoSched0 for 150 seconds
% 7.02/2.25 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 7.02/2.25 # and selection function SelectNewComplexAHP.
% 7.02/2.25 #
% 7.02/2.25 # Preprocessing time : 0.018 s
% 7.02/2.25 # Presaturation interreduction done
% 7.02/2.25
% 7.02/2.25 # Proof found!
% 7.02/2.25 # SZS status Theorem
% 7.02/2.25 # SZS output start CNFRefutation
% See solution above
% 7.02/2.25 # Training examples: 0 positive, 0 negative
% 7.02/2.25
% 7.02/2.25 # -------------------------------------------------
% 7.02/2.25 # User time : 0.019 s
% 7.02/2.25 # System time : 0.006 s
% 7.02/2.25 # Total time : 0.024 s
% 7.02/2.25 # Maximum resident set size: 7124 pages
% 7.02/2.25
%------------------------------------------------------------------------------