TSTP Solution File: SYN013-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYN013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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.37s 0.57s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 10 unt; 33 nHn; 44 RR)
% Number of literals : 122 ( 79 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 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,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_2) ).
cnf(c_3,negated_conjecture,
k != m,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).
cnf(c_4,negated_conjecture,
( X = m
| ~ element(X,m)
| f(X) != m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).
cnf(c_5,negated_conjecture,
( X = m
| ~ element(X,m)
| f(X) != X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
cnf(c_6,negated_conjecture,
( X = m
| ~ element(X,m)
| element(X,f(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
cnf(c_7,negated_conjecture,
( X = m
| ~ element(X,m)
| element(f(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
cnf(c_8,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_8) ).
cnf(c_9,negated_conjecture,
( X = n
| element(X,n)
| g(X) != n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
cnf(c_10,negated_conjecture,
( X = n
| element(X,n)
| g(X) != X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
cnf(c_11,negated_conjecture,
( X = n
| element(X,n)
| element(X,g(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
cnf(c_12,negated_conjecture,
( X = n
| element(X,n)
| element(g(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_12) ).
cnf(c_13,negated_conjecture,
( X = n
| ~ element(X,n)
| Y = n
| Y = X
| ~ element(X,Y)
| ~ element(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
cnf(c_14,negated_conjecture,
( X = k
| X != m
| element(X,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_14) ).
cnf(c_15,negated_conjecture,
( X = k
| X != n
| element(X,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
cnf(c_16,negated_conjecture,
( X = k
| X = m
| X = n
| ~ element(X,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(17,plain,
element(m,k),
inference('UR-RESOLVE',[status(thm)],[c_14,c_3,theory(equality)]) ).
cnf(18,plain,
element(n,k),
inference('UR-RESOLVE',[status(thm)],[c_15,c_2,theory(equality)]) ).
cnf(21,plain,
( element(k,n)
| g(k) = k
| g(k) = m
| g(k) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_16,c_12]),c_2]) ).
cnf(26,plain,
( g(k) = k
| g(k) = m
| g(k) = n
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,21,18]),c_2,c_1,c_3]) ).
cnf(30,plain,
( g(k) = k
| g(k) = m
| g(k) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,26,21,17]),c_3,c_1,c_2]) ).
cnf(32,plain,
( g(k) = k
| g(k) = m
| element(k,n) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_9,30]),c_2]) ).
cnf(33,plain,
( g(k) = k
| g(k) = m
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,32,18]),c_2,c_1,c_3]) ).
cnf(37,plain,
( g(k) = k
| g(k) = m ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,33,32,17]),c_3,c_1,c_2]) ).
cnf(39,plain,
( g(k) = k
| element(k,n)
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c_11,37,theory(equality)]),c_2]) ).
cnf(40,plain,
( g(k) = k
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,39,18]),c_2,c_1,c_3]) ).
cnf(41,plain,
( g(k) = k
| element(f(k),k) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_7,40]),c_3]) ).
cnf(42,plain,
( g(k) = k
| element(k,f(k)) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_6,40]),c_3]) ).
cnf(43,plain,
( g(k) = k
| f(k) = k
| f(k) = m
| f(k) = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,41]) ).
cnf(49,plain,
( f(k) = k
| f(k) = m
| f(k) = n
| element(k,n) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_10,43]),c_2]) ).
cnf(50,plain,
( f(k) = k
| f(k) = m
| f(k) = n
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,49,18]),c_2,c_1,c_3]) ).
cnf(56,plain,
( f(k) = k
| f(k) = m
| f(k) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,50,49,17]),c_3,c_1,c_2]) ).
cnf(58,plain,
( f(k) = k
| f(k) = m
| g(k) = k
| element(k,n) ),
inference('PARAMODULATE',[status(thm)],[42,56,theory(equality)]) ).
cnf(61,plain,
( f(k) = k
| f(k) = m
| g(k) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,58,40,17]),c_3,c_1,c_2]) ).
cnf(62,plain,
( f(k) = k
| f(k) = m
| element(k,n) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_10,61]),c_2]) ).
cnf(63,plain,
( f(k) = k
| f(k) = m
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,62,18]),c_2,c_1,c_3]) ).
cnf(66,plain,
( f(k) = k
| f(k) = m ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,63,62,17]),c_3,c_1,c_2]) ).
cnf(68,plain,
( f(k) = k
| g(k) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_4,66,40]),c_3]) ).
cnf(69,plain,
( f(k) = k
| ~ element(k,m) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c_4,66,theory(equality)]),c_3,theory(equality)]) ).
cnf(70,plain,
( f(k) = k
| element(k,n) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_10,68]),c_2]) ).
cnf(71,plain,
( f(k) = k
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,70,18]),c_2,c_1,c_3]) ).
cnf(73,plain,
f(k) = k,
inference('HYPERRESOLVE',[status(thm)],[69,71]) ).
cnf(75,plain,
~ element(k,m),
inference('UR-RESOLVE',[status(thm)],[c_5,73,c_3]) ).
cnf(76,plain,
g(k) = k,
inference('REWRITE',[status(thm)],[40,75]) ).
cnf(77,plain,
element(k,n),
inference('UR-RESOLVE',[status(thm)],[c_10,76,c_2]) ).
cnf(78,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[c_8,77,c_3,c_1,c_2,18]),75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 17:13:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T17:13:49
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-11T17:13:49
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 #||
% 0.37/0.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.57 % SZS output start Refutation
% See solution above
% 0.37/0.57 ||#
% 0.37/0.57
% 0.37/0.57 ; Summary of computation:
% 0.37/0.57 ; 314 formulas have been input or derived (from 57 formulas).
% 0.37/0.57 ; 78 (25%) were retained. Of these,
% 0.37/0.57 ; 44 (56%) were simplified or subsumed later,
% 0.37/0.57 ; 34 (44%) are still being kept.
% 0.37/0.57 ;
% 0.37/0.57 ; Run time in seconds excluding printing time:
% 0.37/0.57 ; 0.003 3% Read assertion file (1 call)
% 0.37/0.57 ; 0.001 1% Assert (16 calls)
% 0.37/0.57 ; 0.014 16% Process new row (268 calls)
% 0.37/0.57 ; 0.015 17% Resolution (112 calls)
% 0.37/0.57 ; 0.004 4% Paramodulation (56 calls)
% 0.37/0.57 ; 0.001 1% Factoring (36 calls)
% 0.37/0.57 ; 0.003 3% Condensing (119 calls)
% 0.37/0.57 ; 0.004 4% Forward subsumption (119 calls)
% 0.37/0.57 ; 0.004 4% Backward subsumption (68 calls)
% 0.37/0.57 ; 0.001 1% Clause clause subsumption (172 calls)
% 0.37/0.57 ; 0.009 10% Forward simplification (240 calls)
% 0.37/0.57 ; 0.001 1% Backward simplification (78 calls)
% 0.37/0.57 ; 0.003 3% Ordering (1,290 calls)
% 0.37/0.57 ; 0.000 0% Sortal reasoning (32 calls)
% 0.37/0.57 ; 0.000 0% Purity testing (1 call)
% 0.37/0.57 ; 0.026 29% Other
% 0.37/0.57 ; 0.089 Total
% 0.37/0.57 ; 0.094 Real time
% 0.37/0.57 ;
% 0.37/0.57 ; Term-hash-array has 71 terms in all.
% 0.37/0.57 ; Feature-vector-row-index has 24 entries (37 at peak, 68 added, 44 deleted).
% 0.37/0.57 ; Feature-vector-row-index has 112 nodes (172 at peak, 313 added, 201 deleted).
% 0.37/0.57 ; Retrieved 308 possibly forward subsuming rows in 119 calls.
% 0.37/0.57 ; Retrieved 55 possibly backward subsumed rows in 68 calls.
% 0.37/0.57 ; Path-index has 61 entries (72 at peak, 106 added, 45 deleted).
% 0.37/0.57 ; Path-index has 65 nodes (71 at peak, 86 added, 21 deleted).
% 0.37/0.57 ; Trie-index has 61 entries (72 at peak, 106 added, 45 deleted).
% 0.37/0.57 ; Trie-index has 107 nodes (127 at peak, 172 added, 65 deleted).
% 0.37/0.57 ; Retrieved 267 generalization terms in 1,037 calls.
% 0.37/0.57 ; Retrieved 9 instance terms in 9 calls.
% 0.37/0.57 ; Retrieved 2,237 unifiable terms in 699 calls.
% 0.37/0.57 ;
% 0.37/0.57 ; The agenda of rows to process has 7 entries:
% 0.37/0.57 ; 1 with value 14 2 with value 26 2 with value 38
% 0.37/0.57 ; 1 with value 18 1 with value 30
% 0.37/0.57 ; The agenda of rows to give has 5 entries:
% 0.37/0.57 ; 1 with value (4 27) 1 with value (4 51) 1 with value (4 58)
% 0.37/0.57 ; 1 with value (4 37) 1 with value (4 52)
% 0.37/0.57 Evaluation took:
% 0.37/0.57 0.095 seconds of real time
% 0.37/0.57 0.07919 seconds of user run time
% 0.37/0.57 0.015809 seconds of system run time
% 0.37/0.57 0 calls to %EVAL
% 0.37/0.57 0 page faults and
% 0.37/0.57 7,128,504 bytes consed.
% 0.37/0.57 :PROOF-FOUND
% 0.37/0.57 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T17:13:49
% 0.37/0.57 :PROOF-FOUND
% 0.37/0.57 *
%------------------------------------------------------------------------------