TSTP Solution File: SEU267+2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SEU267+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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 : Tue Jul 19 14:20:46 EDT 2022
% Result : Theorem 1.29s 1.44s
% Output : Refutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 3 unt; 0 nHn; 7 RR)
% Number of literals : 19 ( 18 equ; 13 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(74,axiom,
( X != ordered_pair(Y,Z)
| U != pair_first(X)
| X != ordered_pair(V,W)
| U = V ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_mcart_1) ).
cnf(75,plain,
( X != pair_first(Y)
| Y != ordered_pair(Z,U)
| X = Z ),
inference('CONDENSE',[status(thm)],[74]) ).
cnf(111,axiom,
( X != ordered_pair(Y,Z)
| U != pair_second(X)
| X != ordered_pair(V,W)
| U = W ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_mcart_1) ).
cnf(112,plain,
( X != pair_second(Y)
| Y != ordered_pair(Z,U)
| X = U ),
inference('CONDENSE',[status(thm)],[111]) ).
cnf(635,negated_conjecture,
( pair_first(ordered_pair('SKOLEMAAAU130','SKOLEMAAAU131')) != 'SKOLEMAAAU130'
| pair_second(ordered_pair('SKOLEMAAAU130','SKOLEMAAAU131')) != 'SKOLEMAAAU131' ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_mcart_1) ).
cnf(3040,plain,
pair_first(ordered_pair(X,Y)) = X,
inference('HYPERRESOLVE',[status(thm)],[75,theory(equality),theory(equality)]) ).
cnf(3041,plain,
pair_second(ordered_pair('SKOLEMAAAU130','SKOLEMAAAU131')) != 'SKOLEMAAAU131',
inference('REWRITE',[status(thm)],[635,3040,theory(equality)]) ).
cnf(3117,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[112,3041,theory(equality),theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU267+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 21:57:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 *
% 0.20/0.45 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T21:57:02
% 0.20/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-19T21:57:02
% 0.39/0.55
% 0.39/0.55 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.39/0.55 ; Recognized commutativity assertion (= (|set_union2| ?X ?Y) (|set_union2| ?Y ?X)).
% 0.40/0.56 ; Recognized commutativity assertion (= (|set_intersection2| ?X ?Y) (|set_intersection2| ?Y ?X)).
% 0.40/0.56 ; Recognized commutativity assertion (OR (NOT (|disjoint| ?X ?Y)) (|disjoint| ?Y ?X)).
% 0.40/0.57 ; Recognized right identity assertion (= (|set_union2| ?X |empty_set|) ?X).
% 0.40/0.57 ; Recognized right identity assertion (= (|set_difference| ?X |empty_set|) ?X).
% 0.40/0.57 ; Declaring unordered_pair to be commutative.
% 0.40/0.57 ; Declaring set_union2 to be commutative.
% 0.40/0.57 ; Declaring set_intersection2 to be commutative.
% 0.40/0.57 WARNING:
% 0.40/0.57 |are_equipotent| is a 2-ary relation that occurs only positively; disabling rows that contain it.
% 1.29/1.44 ; Declaring disjoint to be commutative.
% 1.29/1.44
% 1.29/1.44 #||
% 1.29/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.29/1.44 % SZS output start Refutation
% See solution above
% 1.29/1.44 ||#
% 1.29/1.44
% 1.29/1.44 ; Summary of computation:
% 1.29/1.44 ; 11356 formulas have been input or derived (from 365 formulas).
% 1.29/1.44 ; 3117 (27%) were retained. Of these,
% 1.29/1.44 ; 177 ( 6%) were simplified or subsumed later,
% 1.29/1.44 ; 2940 (94%) are still being kept.
% 1.29/1.44 ;
% 1.29/1.44 ; Run time in seconds:
% 1.29/1.44 ; 0.077 8% Read assertion file (1 call)
% 1.29/1.44 ; 0.020 2% Assert (342 calls)
% 1.29/1.44 ; 0.173 18% Process new row (10,795 calls)
% 1.29/1.44 ; 0.218 22% Resolution (728 calls)
% 1.29/1.44 ; 0.003 0% Paramodulation (364 calls)
% 1.29/1.44 ; 0.000 0% Factoring (14 calls)
% 1.29/1.44 ; 0.044 4% Condensing (3,834 calls)
% 1.29/1.44 ; 0.077 8% Forward subsumption (3,834 calls)
% 1.29/1.44 ; 0.103 11% Backward subsumption (2,092 calls)
% 1.29/1.44 ; 0.027 3% Clause clause subsumption (4,279 calls)
% 1.29/1.44 ; 0.151 15% Forward simplification (10,789 calls)
% 1.29/1.44 ; 0.014 1% Backward simplification (3,103 calls)
% 1.29/1.44 ; 0.010 1% Ordering (4,067 calls)
% 1.29/1.44 ; 0.000 0% Sortal reasoning (32 calls)
% 1.29/1.44 ; 0.001 0% Purity testing (1 call)
% 1.29/1.44 ; 0.062 6% Other
% 1.29/1.44 ; 0.980 Total
% 1.29/1.44 ; 0.981 Real time
% 1.29/1.44 ;
% 1.29/1.44 ; Term-hash-array has 6,092 terms in all.
% 1.29/1.44 ; Feature-vector-row-index has 2,049 entries (2,049 at peak, 2,092 added, 43 deleted).
% 1.29/1.44 ; Feature-vector-row-index has 8,096 nodes (8,096 at peak, 8,218 added, 122 deleted).
% 1.29/1.44 ; Retrieved 11,107 possibly forward subsuming rows in 3,834 calls.
% 1.29/1.44 ; Retrieved 1,062 possibly backward subsumed rows in 2,092 calls.
% 1.29/1.44 ; Path-index has 5,923 entries (5,923 at peak, 6,140 added, 217 deleted).
% 1.29/1.44 ; Path-index has 11,975 nodes (11,975 at peak, 12,222 added, 247 deleted).
% 1.29/1.44 ; Trie-index has 5,923 entries (5,923 at peak, 6,140 added, 217 deleted).
% 1.29/1.44 ; Trie-index has 16,500 nodes (16,500 at peak, 17,040 added, 540 deleted).
% 1.29/1.44 ; Retrieved 28,276 generalization terms in 45,521 calls.
% 1.29/1.44 ; Retrieved 1,223 instance terms in 1,011 calls.
% 1.29/1.44 ; Retrieved 460,572 unifiable terms in 6,687 calls.
% 1.29/1.44 ;
% 1.29/1.44 ; The agenda of rows to process has 180 entries:
% 1.29/1.44 ; 3 with value 10 18 with value 15 4 with value 21
% 1.29/1.44 ; 1 with value 11 31 with value 16 6 with value 22
% 1.29/1.44 ; 5 with value 12 35 with value 17 3 with value 23
% 1.29/1.44 ; 10 with value 13 32 with value 18 1 with value 25
% 1.29/1.44 ; 19 with value 14 12 with value 19
% 1.29/1.44 ; The agenda of input rows to give has 272 entries:
% 1.29/1.44 ; 14 with value 17 6 with value 28 7 with value 41
% 1.29/1.44 ; 22 with value 18 4 with value 29 2 with value 42
% 1.29/1.44 ; 20 with value 19 5 with value 30 4 with value 44
% 1.29/1.44 ; 18 with value 20 6 with value 31 1 with value 47
% 1.29/1.44 ; 12 with value 21 6 with value 32 3 with value 48
% 1.29/1.44 ; 13 with value 22 6 with value 33 2 with value 49
% 1.29/1.44 ; 29 with value 23 7 with value 34 2 with value 52
% 1.29/1.44 ; 13 with value 24 7 with value 35 2 with value 57
% 1.29/1.44 ; 13 with value 25 4 with value 36 1 with value 67
% 1.29/1.44 ; 18 with value 26 3 with value 37 1 with value 68
% 1.29/1.44 ; 15 with value 27 5 with value 40 1 with value 85
% 1.29/1.44 ; The agenda of rows to give has 2318 entries:
% 1.29/1.44 ; 5 with value (4 4) 127 with value (4 16) 29 with value (4 27)
% 1.29/1.44 ; 16 with value (4 5) 120 with value (4 17) 12 with value (4 28)
% 1.29/1.44 ; 41 with value (4 6) 162 with value (4 18) 10 with value (4 29)
% 1.29/1.44 ; 134 with value (4 7) 121 with value (4 19) 8 with value (4 30)
% 1.29/1.44 ; 50 with value (4 8) 132 with value (4 20) 2 with value (4 31)
% 1.29/1.44 ; 129 with value (4 9) 105 with value (4 21) 7 with value (4 32)
% 1.29/1.44 ; 149 with value (4 10) 57 with value (4 22) 3 with value (4 33)
% 1.29/1.44 ; 161 with value (4 11) 67 with value (4 23) 7 with value (4 35)
% 1.29/1.44 ; 188 with value (4 12) 85 with value (4 24) 2 with value (4 36)
% 1.29/1.44 ; 119 with value (4 13) 24 with value (4 25) 3 with value (4 37)
% 1.29/1.44 ; 104 with value (4 14) 49 with value (4 26) 1 with value (4 38)
% 1.29/1.44 ; 89 with value (4 15)
% 1.29/1.44 Evaluation took:
% 1.29/1.44 0.981 seconds of real time
% 1.29/1.44 0.899181 seconds of user run time
% 1.29/1.44 0.081887 seconds of system run time
% 1.29/1.44 [Run times include 0.085 seconds GC run time.]
% 1.29/1.44 0 calls to %EVAL
% 1.29/1.44 0 page faults and
% 1.29/1.44 76,755,992 bytes consed.
% 1.29/1.44 :PROOF-FOUND
% 1.29/1.44 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T21:57:03
% 1.29/1.44 :PROOF-FOUND
% 1.29/1.44 *
%------------------------------------------------------------------------------