TSTP Solution File: PUZ133+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : PUZ133+1 : TPTP v8.1.0. Released v4.1.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 : Mon Jul 18 18:26:55 EDT 2022
% Result : Theorem 0.59s 0.79s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of clauses : 44 ( 23 unt; 9 nHn; 41 RR)
% Number of literals : 94 ( 31 equ; 48 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ queens_p
| ~ le(s(n0),X)
| ~ le(X,n)
| ~ le(s(X),Y)
| ~ le(Y,n)
| p(X) != p(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p) ).
cnf(2,axiom,
( ~ queens_p
| ~ le(s(n0),X)
| ~ le(X,n)
| ~ le(s(X),Y)
| ~ le(Y,n)
| plus(p(X),X) != plus(p(Y),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p) ).
cnf(3,axiom,
( ~ queens_p
| ~ le(s(n0),X)
| ~ le(X,n)
| ~ le(s(X),Y)
| ~ le(Y,n)
| minus(p(X),X) != minus(p(Y),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p) ).
cnf(5,axiom,
( le(s(n0),'SKOLEMAAAV1')
| queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
cnf(6,axiom,
( le('SKOLEMAAAV1',n)
| queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
cnf(7,axiom,
( le(s('SKOLEMAAAV1'),'SKOLEMAAAV2')
| queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
cnf(8,axiom,
( le('SKOLEMAAAV2',n)
| queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
cnf(9,axiom,
( ~ le(s('SKOLEMAAAV1'),'SKOLEMAAAV2')
| le(s(perm('SKOLEMAAAV2')),perm('SKOLEMAAAV1'))
| queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
cnf(10,axiom,
( q('SKOLEMAAAV1') = q('SKOLEMAAAV2')
| plus(q('SKOLEMAAAV1'),'SKOLEMAAAV1') = plus(q('SKOLEMAAAV2'),'SKOLEMAAAV2')
| minus(q('SKOLEMAAAV1'),'SKOLEMAAAV1') = minus(q('SKOLEMAAAV2'),'SKOLEMAAAV2')
| queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
cnf(11,negated_conjecture,
queens_p,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym) ).
cnf(12,negated_conjecture,
q(X) = p(perm(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym) ).
cnf(13,negated_conjecture,
~ queens_q,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym) ).
cnf(14,axiom,
( ~ le(s(n0),X)
| ~ le(X,n)
| le(s(n0),perm(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_range) ).
cnf(15,axiom,
( ~ le(s(n0),X)
| ~ le(X,n)
| le(perm(X),n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_range) ).
cnf(16,axiom,
minus(X,Y) = minus(perm(Y),perm(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_another_one) ).
cnf(17,axiom,
( ~ le(X,Y)
| ~ le(Y,Z)
| le(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans) ).
cnf(18,axiom,
le(X,s(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_le) ).
cnf(19,axiom,
( plus(X,Y) != plus(Z,U)
| minus(X,Z) = minus(U,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1) ).
cnf(20,axiom,
( plus(X,Y) = plus(Z,U)
| minus(X,Z) != minus(U,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1) ).
cnf(21,axiom,
( minus(X,Y) != minus(Z,U)
| minus(X,Z) = minus(Y,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',minus1) ).
cnf(22,plain,
le(s(n0),'SKOLEMAAAV1'),
inference('REWRITE',[status(thm)],[5,13]) ).
cnf(23,plain,
le('SKOLEMAAAV1',n),
inference('REWRITE',[status(thm)],[6,13]) ).
cnf(24,plain,
le(s('SKOLEMAAAV1'),'SKOLEMAAAV2'),
inference('REWRITE',[status(thm)],[7,13]) ).
cnf(25,plain,
le('SKOLEMAAAV2',n),
inference('REWRITE',[status(thm)],[8,13]) ).
cnf(26,plain,
le(s(perm('SKOLEMAAAV2')),perm('SKOLEMAAAV1')),
inference('REWRITE',[status(thm)],[9,24,13]) ).
cnf(27,plain,
( p(perm('SKOLEMAAAV1')) = p(perm('SKOLEMAAAV2'))
| plus(p(perm('SKOLEMAAAV1')),'SKOLEMAAAV1') = plus(p(perm('SKOLEMAAAV2')),'SKOLEMAAAV2')
| minus(p(perm('SKOLEMAAAV1')),'SKOLEMAAAV1') = minus(p(perm('SKOLEMAAAV2')),'SKOLEMAAAV2') ),
inference('REWRITE',[status(thm)],[10,13,12,theory(equality)]) ).
cnf(28,plain,
( ~ le(s(n0),X)
| ~ le(X,n)
| ~ le(s(X),Y)
| ~ le(Y,n)
| p(X) != p(Y) ),
inference('REWRITE',[status(thm)],[1,11]) ).
cnf(29,plain,
( ~ le(s(n0),X)
| ~ le(X,n)
| ~ le(s(X),Y)
| ~ le(Y,n)
| plus(p(X),X) != plus(p(Y),Y) ),
inference('REWRITE',[status(thm)],[2,11]) ).
cnf(30,plain,
( ~ le(s(n0),X)
| ~ le(X,n)
| ~ le(s(X),Y)
| ~ le(Y,n)
| minus(p(X),X) != minus(p(Y),Y) ),
inference('REWRITE',[status(thm)],[3,11]) ).
cnf(31,plain,
le('SKOLEMAAAV1','SKOLEMAAAV2'),
inference('HYPERRESOLVE',[status(thm)],[17,18,24]) ).
cnf(39,plain,
le(perm('SKOLEMAAAV2'),perm('SKOLEMAAAV1')),
inference('HYPERRESOLVE',[status(thm)],[17,18,26]) ).
cnf(42,plain,
le(perm('SKOLEMAAAV1'),n),
inference('HYPERRESOLVE',[status(thm)],[15,22,23]) ).
cnf(63,plain,
( p(perm('SKOLEMAAAV1')) = p(perm('SKOLEMAAAV2'))
| minus(p(perm('SKOLEMAAAV1')),'SKOLEMAAAV1') = minus(p(perm('SKOLEMAAAV2')),'SKOLEMAAAV2')
| minus(p(perm('SKOLEMAAAV2')),p(perm('SKOLEMAAAV1'))) = minus('SKOLEMAAAV1','SKOLEMAAAV2') ),
inference('HYPERRESOLVE',[status(thm)],[19,27]) ).
cnf(67,plain,
le(s(n0),'SKOLEMAAAV2'),
inference('HYPERRESOLVE',[status(thm)],[17,31,22]) ).
cnf(99,plain,
le(perm('SKOLEMAAAV2'),n),
inference('HYPERRESOLVE',[status(thm)],[17,39,42]) ).
cnf(108,plain,
le(s(n0),perm('SKOLEMAAAV2')),
inference('HYPERRESOLVE',[status(thm)],[14,67,25]) ).
cnf(182,plain,
p(perm('SKOLEMAAAV1')) != p(perm('SKOLEMAAAV2')),
inference('UR-RESOLVE',[status(thm)],[28,108,99,26,42]) ).
cnf(185,plain,
( minus(p(perm('SKOLEMAAAV1')),'SKOLEMAAAV1') = minus(p(perm('SKOLEMAAAV2')),'SKOLEMAAAV2')
| minus(p(perm('SKOLEMAAAV2')),p(perm('SKOLEMAAAV1'))) = minus('SKOLEMAAAV1','SKOLEMAAAV2') ),
inference('REWRITE',[status(thm)],[63,182]) ).
cnf(190,plain,
minus(p(perm('SKOLEMAAAV2')),perm('SKOLEMAAAV2')) != minus(p(perm('SKOLEMAAAV1')),perm('SKOLEMAAAV1')),
inference('UR-RESOLVE',[status(thm)],[30,108,99,26,42]) ).
cnf(191,plain,
plus(p(perm('SKOLEMAAAV2')),perm('SKOLEMAAAV2')) != plus(p(perm('SKOLEMAAAV1')),perm('SKOLEMAAAV1')),
inference('UR-RESOLVE',[status(thm)],[29,108,99,26,42]) ).
cnf(986,plain,
minus(p(perm('SKOLEMAAAV2')),p(perm('SKOLEMAAAV1'))) != minus('SKOLEMAAAV1','SKOLEMAAAV2'),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[21,190]),16,theory(equality)]) ).
cnf(987,plain,
minus(p(perm('SKOLEMAAAV1')),'SKOLEMAAAV1') = minus(p(perm('SKOLEMAAAV2')),'SKOLEMAAAV2'),
inference('REWRITE',[status(thm)],[185,986]) ).
cnf(995,plain,
minus(p(perm('SKOLEMAAAV2')),p(perm('SKOLEMAAAV1'))) = minus('SKOLEMAAAV2','SKOLEMAAAV1'),
inference('HYPERRESOLVE',[status(thm)],[21,987]) ).
cnf(1038,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[20,191]),16,995,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ133+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat May 28 23:00:59 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-28T23:00:59
% 0.18/0.46 ; 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-05-28T23:00:59
% 0.59/0.79
% 0.59/0.79
% 0.59/0.79 #||
% 0.59/0.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.59/0.79 % SZS output start Refutation
% See solution above
% 0.59/0.81 ||#
% 0.59/0.81
% 0.59/0.81 ; Summary of computation:
% 0.59/0.81 ; 5329 formulas have been input or derived (from 428 formulas).
% 0.59/0.81 ; 1038 (19%) were retained. Of these,
% 0.59/0.81 ; 55 ( 5%) were simplified or subsumed later,
% 0.59/0.81 ; 983 (95%) are still being kept.
% 0.59/0.81 ;
% 0.59/0.81 ; Run time in seconds excluding printing time:
% 0.59/0.81 ; 0.004 1% Read assertion file (1 call)
% 0.59/0.81 ; 0.001 0% Assert (10 calls)
% 0.59/0.81 ; 0.071 21% Process new row (4,356 calls)
% 0.59/0.81 ; 0.127 38% Resolution (854 calls)
% 0.59/0.81 ; 0.014 4% Paramodulation (427 calls)
% 0.59/0.81 ; 0.000 0% Factoring (2 calls)
% 0.59/0.81 ; 0.005 2% Condensing (244 calls)
% 0.59/0.81 ; 0.008 2% Forward subsumption (244 calls)
% 0.59/0.81 ; 0.004 1% Backward subsumption (142 calls)
% 0.59/0.81 ; 0.010 3% Clause clause subsumption (745 calls)
% 0.59/0.81 ; 0.034 10% Forward simplification (4,347 calls)
% 0.59/0.81 ; 0.014 4% Backward simplification (1,038 calls)
% 0.59/0.81 ; 0.006 2% Ordering (926 calls)
% 0.59/0.81 ; 0.000 0% Sortal reasoning (32 calls)
% 0.59/0.81 ; 0.000 0% Purity testing (1 call)
% 0.59/0.81 ; 0.035 11% Other
% 0.59/0.81 ; 0.333 Total
% 0.59/0.81 ; 0.345 Real time
% 0.59/0.81 ;
% 0.59/0.81 ; Term-hash-array has 1,413 terms in all.
% 0.59/0.81 ; Feature-vector-row-index has 117 entries (117 at peak, 142 added, 25 deleted).
% 0.59/0.81 ; Feature-vector-row-index has 376 nodes (376 at peak, 534 added, 158 deleted).
% 0.59/0.81 ; Retrieved 867 possibly forward subsuming rows in 244 calls.
% 0.59/0.81 ; Retrieved 181 possibly backward subsumed rows in 142 calls.
% 0.59/0.81 ; Path-index has 1,355 entries (1,355 at peak, 1,477 added, 122 deleted).
% 0.59/0.81 ; Path-index has 884 nodes (884 at peak, 979 added, 95 deleted).
% 0.59/0.81 ; Trie-index has 1,355 entries (1,355 at peak, 1,477 added, 122 deleted).
% 0.59/0.81 ; Trie-index has 2,606 nodes (2,606 at peak, 2,913 added, 307 deleted).
% 0.59/0.81 ; Retrieved 6,861 generalization terms in 7,725 calls.
% 0.59/0.81 ; Retrieved 955 instance terms in 897 calls.
% 0.59/0.81 ; Retrieved 54,034 unifiable terms in 15,944 calls.
% 0.59/0.81 ;
% 0.59/0.81 ; The agenda of rows to process has 3 entries:
% 0.59/0.81 ; 3 with value 22
% 0.59/0.81 ; The agenda of rows to give has 562 entries:
% 0.59/0.81 ; 33 with value (4 21) 50 with value (4 27) 43 with value (4 33)
% 0.59/0.81 ; 52 with value (4 22) 41 with value (4 28) 2 with value (4 34)
% 0.59/0.81 ; 38 with value (4 23) 50 with value (4 29) 1 with value (4 46)
% 0.59/0.81 ; 50 with value (4 24) 41 with value (4 30) 2 with value (4 47)
% 0.59/0.81 ; 49 with value (4 25) 35 with value (4 31) 1 with value (4 50)
% 0.59/0.81 ; 41 with value (4 26) 31 with value (4 32) 2 with value (4 51)
% 0.59/0.81 Evaluation took:
% 0.59/0.81 0.346 seconds of real time
% 0.59/0.81 0.307552 seconds of user run time
% 0.59/0.81 0.038172 seconds of system run time
% 0.59/0.81 [Run times include 0.016 seconds GC run time.]
% 0.59/0.81 0 calls to %EVAL
% 0.59/0.81 0 page faults and
% 0.59/0.81 26,614,728 bytes consed.
% 0.59/0.81 :PROOF-FOUND
% 0.59/0.81 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-28T23:01:00
% 0.59/0.81 :PROOF-FOUND
% 0.59/0.81 *
%------------------------------------------------------------------------------