%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYN014-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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 : 600s
% DateTime : Thu Jul 21 11:56:32 EDT 2022
% Result : Unsatisfiable 0.79s 0.99s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 15
% Syntax : Number of clauses : 62 ( 6 unt; 53 nHn; 61 RR)
% Number of literals : 215 ( 163 equ; 32 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_1,negated_conjecture,
m != n,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_1) ).
cnf(c_2,negated_conjecture,
( n = k
| m = k ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_2) ).
cnf(c_3,negated_conjecture,
( X = j
| X != k
| element(X,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).
cnf(c_4,negated_conjecture,
( X = j
| X = k
| ~ element(X,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).
cnf(c_5,negated_conjecture,
( X = m
| ~ element(X,m)
| f(X) != m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
cnf(c_6,negated_conjecture,
( X = m
| ~ element(X,m)
| f(X) != X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
cnf(c_7,negated_conjecture,
( X = m
| ~ element(X,m)
| element(X,f(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
cnf(c_8,negated_conjecture,
( X = m
| ~ element(X,m)
| element(f(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).
cnf(c_9,negated_conjecture,
( X = m
| element(X,m)
| Y = m
| Y = X
| ~ element(X,Y)
| ~ element(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
cnf(c_10,negated_conjecture,
( X = n
| element(X,n)
| g(X) != n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
cnf(c_11,negated_conjecture,
( X = n
| element(X,n)
| g(X) != X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
cnf(c_13,negated_conjecture,
( X = n
| element(X,n)
| element(g(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
cnf(c_15,negated_conjecture,
( X = k
| X != m
| element(X,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
cnf(c_16,negated_conjecture,
( X = k
| X != n
| element(X,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(c_17,negated_conjecture,
( X = k
| X = m
| X = n
| ~ element(X,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_17) ).
cnf(18,plain,
( k = j
| element(k,j) ),
inference('HYPERRESOLVE',[status(thm)],[c_3,theory(equality)]) ).
cnf(20,plain,
( m = k
| element(m,k) ),
inference('HYPERRESOLVE',[status(thm)],[c_15,theory(equality)]) ).
cnf(21,plain,
( n = k
| element(n,k) ),
inference('HYPERRESOLVE',[status(thm)],[c_16,theory(equality)]) ).
cnf(22,plain,
( m = k
| X = k
| element(X,k)
| g(X) != k ),
inference('PARAMODULATE',[status(thm)],[c_10,c_2,theory(equality)]) ).
cnf(23,plain,
( n = j
| element(j,n)
| g(j) = j
| g(j) = k ),
inference('HYPERRESOLVE',[status(thm)],[c_4,c_13]) ).
cnf(32,plain,
( m = k
| k = j
| element(j,k)
| g(j) = j
| g(j) = k ),
inference('PARAMODULATE',[status(thm)],[23,c_2,theory(equality)]) ).
cnf(35,plain,
( m = k
| k = j
| g(j) = j
| g(j) = k
| j = m
| n = j ),
inference('HYPERRESOLVE',[status(thm)],[c_17,32]) ).
cnf(51,plain,
( m = k
| k = j
| g(j) = j
| j = m
| n = j
| element(j,k) ),
inference('HYPERRESOLVE',[status(thm)],[22,35]) ).
cnf(55,plain,
( m = k
| k = j
| g(j) = j
| j = m
| n = j ),
inference('HYPERRESOLVE',[status(thm)],[c_17,51]) ).
cnf(56,plain,
( m = k
| k = j
| j = m
| n = j
| element(j,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_11,55]) ).
cnf(57,plain,
( m = k
| k = j
| j = m
| element(j,k) ),
inference('PARAMODULATE',[status(thm)],[56,c_2,theory(equality)]) ).
cnf(60,plain,
( m = k
| k = j
| j = m
| n = j ),
inference('HYPERRESOLVE',[status(thm)],[c_17,57]) ).
cnf(63,plain,
( m = k
| k = j
| j = m ),
inference('PARAMODULATE',[status(thm)],[c_2,60,theory(equality)]) ).
cnf(65,plain,
( k = j
| j = m
| n != k ),
inference('PARAMODULATE',[status(thm)],[c_1,63,theory(equality)]) ).
cnf(66,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| element(f(X),X) ),
inference('PARAMODULATE',[status(thm)],[c_8,63,theory(equality)]) ).
cnf(67,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| element(X,f(X)) ),
inference('PARAMODULATE',[status(thm)],[c_7,63,theory(equality)]) ).
cnf(68,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| f(X) != X ),
inference('PARAMODULATE',[status(thm)],[c_6,63,theory(equality)]) ).
cnf(69,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| f(X) != k ),
inference('PARAMODULATE',[status(thm)],[c_5,63,theory(equality)]) ).
cnf(73,plain,
( n = k
| k = j
| j = m
| element(f(n),n) ),
inference('HYPERRESOLVE',[status(thm)],[66,21]) ).
cnf(74,plain,
( n = k
| k = j
| j = m
| element(n,f(n)) ),
inference('HYPERRESOLVE',[status(thm)],[67,21]) ).
cnf(76,plain,
( n = k
| k = j
| j = m
| f(n) = m
| element(f(n),m)
| f(n) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_9,74,73]),c_1]) ).
cnf(121,plain,
( k = j
| j = m
| n = k
| f(n) = k
| element(f(n),k)
| f(n) = n ),
inference('PARAMODULATE',[status(thm)],[76,63,theory(equality)]) ).
cnf(138,plain,
( k = j
| j = m
| n = k
| f(n) = k
| f(n) = n
| f(n) = m ),
inference('HYPERRESOLVE',[status(thm)],[c_17,121]) ).
cnf(150,plain,
( k = j
| j = m
| n = k
| f(n) = k
| f(n) = m ),
inference('HYPERRESOLVE',[status(thm)],[68,138,21]) ).
cnf(151,plain,
( k = j
| j = m
| n = k
| f(n) = k
| element(n,m) ),
inference('PARAMODULATE',[status(thm)],[74,150,theory(equality)]) ).
cnf(156,plain,
( k = j
| j = m
| n = k
| f(n) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_5,151,150]),c_1]) ).
cnf(157,plain,
( k = j
| j = m
| n = k ),
inference('HYPERRESOLVE',[status(thm)],[69,156,21]) ).
cnf(158,plain,
( k = j
| j = m ),
inference('HYPERRESOLVE',[status(thm)],[65,157]) ).
cnf(162,plain,
( k = j
| X = j
| ~ element(X,j)
| element(f(X),X) ),
inference('PARAMODULATE',[status(thm)],[c_8,158,theory(equality)]) ).
cnf(163,plain,
( k = j
| X = j
| ~ element(X,j)
| element(X,f(X)) ),
inference('PARAMODULATE',[status(thm)],[c_7,158,theory(equality)]) ).
cnf(164,plain,
( k = j
| X = j
| ~ element(X,j)
| f(X) != X ),
inference('PARAMODULATE',[status(thm)],[c_6,158,theory(equality)]) ).
cnf(177,plain,
( k = j
| element(f(k),k) ),
inference('HYPERRESOLVE',[status(thm)],[162,18]) ).
cnf(179,plain,
( k = j
| f(k) = k
| f(k) = m
| f(k) = n ),
inference('HYPERRESOLVE',[status(thm)],[c_17,177]) ).
cnf(181,plain,
( k = j
| element(k,f(k)) ),
inference('HYPERRESOLVE',[status(thm)],[163,18]) ).
cnf(195,plain,
( k = j
| f(k) = k
| f(k) = m
| ~ element(k,j)
| n != k ),
inference('PARAMODULATE',[status(thm)],[164,179,theory(equality)]) ).
cnf(209,plain,
( k = j
| m = k
| f(k) = k
| f(k) = m ),
inference('HYPERRESOLVE',[status(thm)],[195,18,c_2]) ).
cnf(210,plain,
( k = j
| m = k
| f(k) = k
| element(k,m) ),
inference('PARAMODULATE',[status(thm)],[181,209,theory(equality)]) ).
cnf(213,plain,
( k = j
| m = k
| f(k) = k ),
inference('HYPERRESOLVE',[status(thm)],[c_5,210,209]) ).
cnf(214,plain,
( k = j
| m = k ),
inference('HYPERRESOLVE',[status(thm)],[164,213,18]) ).
cnf(215,plain,
k = j,
inference('PARAMODULATE',[status(thm)],[158,214,theory(equality)]) ).
cnf(217,plain,
( X = j
| ~ element(X,j) ),
inference('REWRITE',[status(thm)],[c_4,215,theory(equality)]) ).
cnf(220,plain,
( j = m
| element(m,j) ),
inference('REWRITE',[status(thm)],[20,215,theory(equality)]) ).
cnf(221,plain,
( n = j
| element(n,j) ),
inference('REWRITE',[status(thm)],[21,215,theory(equality)]) ).
cnf(229,plain,
j = m,
inference('HYPERRESOLVE',[status(thm)],[217,220]) ).
cnf(230,plain,
n != j,
inference('REWRITE',[status(thm)],[c_1,229,theory(equality)]) ).
cnf(231,plain,
element(n,j),
inference('REWRITE',[status(thm)],[221,230]) ).
cnf(240,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[217,230]),231]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN014-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 15:43:49 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.51 #<PACKAGE "SNARK-USER">
% 0.21/0.51 *
% 0.21/0.51 SNARK-TPTP-OPTIONS
% 0.21/0.51 *
% 0.21/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.51 (USE-FACTORING :POS)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.51 *
% 0.21/0.51 "."
% 0.21/0.51 *
% 0.21/0.51 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T15:43:49
% 0.21/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-07-11T15:43:49
% 0.79/0.99
% 0.79/0.99
% 0.79/0.99 #||
% 0.79/0.99 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.79/0.99 % SZS output start Refutation
% See solution above
% 0.84/1.00 ||#
% 0.84/1.00
% 0.84/1.00 ; Summary of computation:
% 0.84/1.00 ; 1831 formulas have been input or derived (from 141 formulas).
% 0.84/1.00 ; 240 (13%) were retained. Of these,
% 0.84/1.00 ; 220 (92%) were simplified or subsumed later,
% 0.84/1.00 ; 20 ( 8%) are still being kept.
% 0.84/1.00 ;
% 0.84/1.00 ; Run time in seconds excluding printing time:
% 0.84/1.00 ; 0.003 1% Read assertion file (1 call)
% 0.84/1.00 ; 0.000 0% Assert (17 calls)
% 0.84/1.00 ; 0.026 5% Process new row (1,556 calls)
% 0.84/1.00 ; 0.090 19% Resolution (280 calls)
% 0.84/1.00 ; 0.025 5% Paramodulation (140 calls)
% 0.84/1.00 ; 0.000 0% Factoring (105 calls)
% 0.84/1.00 ; 0.006 1% Condensing (903 calls)
% 0.84/1.00 ; 0.146 30% Forward subsumption (903 calls)
% 0.84/1.00 ; 0.015 3% Backward subsumption (234 calls)
% 0.84/1.00 ; 0.024 5% Clause clause subsumption (3,017 calls)
% 0.84/1.00 ; 0.082 17% Forward simplification (1,367 calls)
% 0.84/1.00 ; 0.005 1% Backward simplification (240 calls)
% 0.84/1.00 ; 0.022 5% Ordering (14,625 calls)
% 0.84/1.00 ; 0.000 0% Sortal reasoning (32 calls)
% 0.84/1.00 ; 0.000 0% Purity testing (1 call)
% 0.84/1.00 ; 0.039 8% Other
% 0.84/1.00 ; 0.483 Total
% 0.84/1.00 ; 0.487 Real time
% 0.84/1.00 ;
% 0.84/1.00 ; Term-hash-array has 174 terms in all.
% 0.84/1.00 ; Feature-vector-row-index has 15 entries (116 at peak, 234 added, 219 deleted).
% 0.84/1.00 ; Feature-vector-row-index has 70 nodes (794 at peak, 1,623 added, 1,553 deleted).
% 0.84/1.00 ; Retrieved 7,873 possibly forward subsuming rows in 903 calls.
% 0.84/1.00 ; Retrieved 378 possibly backward subsumed rows in 234 calls.
% 0.84/1.00 ; Path-index has 36 entries (150 at peak, 212 added, 176 deleted).
% 0.84/1.00 ; Path-index has 58 nodes (118 at peak, 150 added, 92 deleted).
% 0.84/1.00 ; Trie-index has 36 entries (150 at peak, 212 added, 176 deleted).
% 0.84/1.00 ; Trie-index has 67 nodes (258 at peak, 370 added, 303 deleted).
% 0.84/1.00 ; Retrieved 344 generalization terms in 8,883 calls.
% 0.84/1.00 ; Retrieved 5 instance terms in 5 calls.
% 0.84/1.00 ; Retrieved 6,527 unifiable terms in 1,995 calls.
% 0.84/1.00 ;
% 0.84/1.00 ; The agenda of input rows to give has 1 entry:
% 0.84/1.00 ; 1 with value 24
% 0.84/1.00 ; The agenda of rows to give has 10 entries:
% 0.84/1.00 ; 1 with value (4 5) 1 with value (4 29) 2 with value (4 35)
% 0.84/1.00 ; 1 with value (4 6) 1 with value (4 31) 1 with value (4 51)
% 0.84/1.00 ; 1 with value (4 11) 1 with value (4 32) 1 with value (4 52)
% 0.84/1.00 Evaluation took:
% 0.84/1.00 0.488 seconds of real time
% 0.84/1.00 0.443009 seconds of user run time
% 0.84/1.00 0.044823 seconds of system run time
% 0.84/1.00 [Run times include 0.008 seconds GC run time.]
% 0.84/1.00 0 calls to %EVAL
% 0.84/1.00 0 page faults and
% 0.84/1.00 35,563,504 bytes consed.
% 0.84/1.00 :PROOF-FOUND
% 0.84/1.00 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T15:43:49
% 0.84/1.00 :PROOF-FOUND
% 0.84/1.00 *
%------------------------------------------------------------------------------