TSTP Solution File: COL003-20 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COL003-20 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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 : Fri Jul 15 00:41:34 EDT 2022
% Result : Unsatisfiable 71.37s 71.57s
% Output : Refutation 71.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_definition,axiom,
apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(w_definition,axiom,
apply(apply(w,X),Y) = apply(apply(X,Y),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_definition) ).
cnf(strong_fixed_point,axiom,
strong_fixed_point = apply(apply(b,apply(w,w)),apply(apply(b,apply(b,w)),apply(apply(b,b),b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',strong_fixed_point) ).
cnf(prove_strong_fixed_point,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
cnf(6,plain,
apply(apply(w,apply(w,X)),Y) = apply(apply(apply(X,Y),Y),Y),
inference('PARAMODULATE',[status(thm)],[w_definition,w_definition,theory(equality)]) ).
cnf(8,plain,
apply(apply(w,apply(b,X)),Y) = apply(X,apply(Y,Y)),
inference('PARAMODULATE',[status(thm)],[w_definition,b_definition,theory(equality)]) ).
cnf(9,plain,
apply(apply(apply(w,b),X),Y) = apply(X,apply(X,Y)),
inference('PARAMODULATE',[status(thm)],[b_definition,w_definition,theory(equality)]) ).
cnf(10,plain,
apply(apply(apply(b,X),apply(w,Y)),Z) = apply(X,apply(apply(Y,Z),Z)),
inference('PARAMODULATE',[status(thm)],[b_definition,w_definition,theory(equality)]) ).
cnf(11,plain,
apply(apply(apply(b,X),apply(Y,Z)),Z) = apply(X,apply(apply(w,Y),Z)),
inference('PARAMODULATE',[status(thm)],[b_definition,w_definition,theory(equality)]) ).
cnf(12,plain,
apply(apply(w,apply(apply(b,X),Y)),Z) = apply(apply(X,apply(Y,Z)),Z),
inference('PARAMODULATE',[status(thm)],[w_definition,b_definition,theory(equality)]) ).
cnf(15,plain,
apply(apply(apply(b,X),Y),apply(Z,U)) = apply(X,apply(apply(apply(b,Y),Z),U)),
inference('PARAMODULATE',[status(thm)],[b_definition,b_definition,theory(equality)]) ).
cnf(20,plain,
apply(strong_fixed_point,X) = apply(apply(apply(b,apply(w,w)),apply(b,w)),apply(apply(apply(b,b),b),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[b_definition,strong_fixed_point,theory(equality)]),15,theory(equality)]) ).
cnf(28,plain,
apply(apply(w,apply(w,apply(b,X))),Y) = apply(apply(X,apply(Y,Y)),Y),
inference('PARAMODULATE',[status(thm)],[w_definition,8,theory(equality)]) ).
cnf(77,plain,
apply(apply(w,apply(X,Y)),Y) = apply(apply(w,apply(w,X)),Y),
inference('PARAMODULATE',[status(thm)],[w_definition,6,theory(equality)]) ).
cnf(195,plain,
apply(apply(w,apply(X,Y)),Y) = apply(apply(apply(apply(w,b),w),X),Y),
inference('PARAMODULATE',[status(thm)],[77,9,theory(equality)]) ).
cnf(340,plain,
apply(apply(apply(b,X),apply(w,w)),Y) = apply(apply(apply(b,X),apply(Y,Y)),Y),
inference('PARAMODULATE',[status(thm)],[10,11,theory(equality)]) ).
cnf(511,plain,
apply(apply(apply(apply(b,w),apply(b,X)),Y),Z) = apply(apply(X,apply(Y,Z)),Z),
inference('PARAMODULATE',[status(thm)],[12,b_definition,theory(equality)]) ).
cnf(3314,plain,
apply(apply(apply(apply(w,b),w),apply(b,apply(b,X))),Y) = apply(apply(apply(b,X),apply(w,w)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,340,theory(equality)]),9,theory(equality)]) ).
cnf(7281,plain,
apply(apply(apply(apply(b,w),apply(b,w)),X),Y) = apply(apply(apply(apply(w,b),w),X),Y),
inference('PARAMODULATE',[status(thm)],[195,511,theory(equality)]) ).
cnf(8155,plain,
apply(strong_fixed_point,X) = apply(apply(apply(b,apply(w,w)),apply(b,w)),apply(b,apply(b,X))),
inference('PARAMODULATE',[status(thm)],[20,b_definition,theory(equality)]) ).
cnf(8542,plain,
apply(strong_fixed_point,X) = apply(apply(w,w),apply(apply(b,w),apply(b,apply(b,X)))),
inference('PARAMODULATE',[status(thm)],[b_definition,8155,theory(equality)]) ).
cnf(8543,plain,
apply(apply(apply(b,X),apply(w,w)),apply(apply(b,w),apply(b,apply(b,Y)))) = apply(X,apply(strong_fixed_point,Y)),
inference('PARAMODULATE',[status(thm)],[15,8155,theory(equality)]) ).
cnf(8574,plain,
apply(strong_fixed_point,X) = apply(X,apply(strong_fixed_point,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[w_definition,8542,theory(equality)]),8543,3314,7281,b_definition,theory(equality)]) ).
cnf(8575,plain,
$false,
inference('REWRITE',[status(thm)],[prove_strong_fixed_point,8574,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL003-20 : TPTP v8.1.0. Released v2.1.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 05:41:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T05:41:28
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-05-31T05:41:28
% 71.37/71.57
% 71.37/71.57
% 71.37/71.57 #||
% 71.37/71.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 71.37/71.57 % SZS output start Refutation
% See solution above
% 71.37/71.60 ||#
% 71.37/71.60
% 71.37/71.60 ; Summary of computation:
% 71.37/71.60 ; 27814 formulas have been input or derived (from 93 formulas).
% 71.37/71.60 ; 8575 (31%) were retained. Of these,
% 71.37/71.60 ; 1170 (14%) were simplified or subsumed later,
% 71.37/71.60 ; 7405 (86%) are still being kept.
% 71.37/71.60 ;
% 71.37/71.60 ; Run time in seconds excluding printing time:
% 71.37/71.60 ; 0.001 0% Read assertion file (1 call)
% 71.37/71.60 ; 0.000 0% Assert (4 calls)
% 71.37/71.60 ; 1.480 2% Process new row (27,607 calls)
% 71.37/71.60 ; 0.045 0% Resolution (184 calls)
% 71.37/71.60 ; 0.651 1% Paramodulation (92 calls)
% 71.37/71.60 ; 22.452 32% Forward simplification (27,513 calls)
% 71.37/71.60 ; 3.025 4% Backward simplification (8,575 calls)
% 71.37/71.60 ; 43.260 61% Ordering (4,762,361 calls)
% 71.37/71.60 ; 0.000 0% Sortal reasoning (32 calls)
% 71.37/71.60 ; 0.000 0% Purity testing (1 call)
% 71.37/71.60 ; 0.167 0% Other
% 71.37/71.60 ; 71.081 Total
% 71.37/71.60 ; 71.131 Real time
% 71.37/71.60 ;
% 71.37/71.60 ; Term-hash-array has 26,151 terms in all.
% 71.37/71.60 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 71.37/71.60 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 71.37/71.60 ; Path-index has 23,475 entries (23,480 at peak, 26,724 added, 3,249 deleted).
% 71.37/71.60 ; Path-index has 2,135 nodes (2,143 at peak, 2,220 added, 85 deleted).
% 71.37/71.60 ; Trie-index has 23,475 entries (23,480 at peak, 26,724 added, 3,249 deleted).
% 71.37/71.60 ; Trie-index has 156,203 nodes (156,243 at peak, 177,606 added, 21,403 deleted).
% 71.37/71.60 ; Retrieved 10,602,959 generalization terms in 521,515 calls.
% 71.37/71.60 ; Retrieved 977,303 instance terms in 22,900 calls.
% 71.37/71.60 ; Retrieved 317,522 unifiable terms in 1,019 calls.
% 71.37/71.60 ;
% 71.37/71.60 ; The agenda of rows to process has 97 entries:
% 71.37/71.60 ; 3 with value 35 3 with value 44 1 with value 52
% 71.37/71.60 ; 8 with value 36 2 with value 45 3 with value 53
% 71.37/71.60 ; 7 with value 37 3 with value 46 3 with value 55
% 71.37/71.60 ; 11 with value 38 1 with value 47 2 with value 56
% 71.37/71.60 ; 11 with value 39 3 with value 48 1 with value 59
% 71.37/71.60 ; 10 with value 40 1 with value 49 2 with value 61
% 71.37/71.60 ; 7 with value 41 1 with value 50 5 with value 64
% 71.37/71.60 ; 4 with value 42 2 with value 51 1 with value 68
% 71.37/71.60 ; 2 with value 43
% 71.37/71.60 ; The agenda of rows to give has 7316 entries:
% 71.37/71.60 ; 1 with value (4 16) 368 with value (4 44) 7 with value (4 62)
% 71.37/71.60 ; 1 with value (4 26) 239 with value (4 45) 6 with value (4 63)
% 71.37/71.60 ; 47 with value (4 27) 272 with value (4 46) 12 with value (4 64)
% 71.37/71.60 ; 44 with value (4 28) 200 with value (4 47) 7 with value (4 65)
% 71.37/71.60 ; 72 with value (4 29) 158 with value (4 48) 6 with value (4 66)
% 71.37/71.60 ; 105 with value (4 30) 119 with value (4 49) 3 with value (4 67)
% 71.37/71.60 ; 118 with value (4 31) 98 with value (4 50) 3 with value (4 68)
% 71.37/71.60 ; 166 with value (4 32) 69 with value (4 51) 1 with value (4 69)
% 71.37/71.60 ; 231 with value (4 33) 89 with value (4 52) 2 with value (4 70)
% 71.37/71.60 ; 312 with value (4 34) 51 with value (4 53) 3 with value (4 71)
% 71.37/71.60 ; 300 with value (4 35) 56 with value (4 54) 3 with value (4 72)
% 71.37/71.60 ; 445 with value (4 36) 41 with value (4 55) 1 with value (4 73)
% 71.37/71.60 ; 422 with value (4 37) 19 with value (4 56) 1 with value (4 74)
% 71.37/71.60 ; 505 with value (4 38) 13 with value (4 57) 1 with value (4 76)
% 71.37/71.60 ; 667 with value (4 39) 19 with value (4 58) 1 with value (4 77)
% 71.37/71.60 ; 684 with value (4 40) 22 with value (4 59) 1 with value (4 79)
% 71.37/71.60 ; 508 with value (4 41) 13 with value (4 60) 1 with value (4 81)
% 71.37/71.60 ; 477 with value (4 42) 11 with value (4 61) 1 with value (4 84)
% 71.37/71.60 ; 294 with value (4 43)
% 71.37/71.60 Evaluation took:
% 71.37/71.60 71.133 seconds of real time
% 71.37/71.60 65.46816 seconds of user run time
% 71.37/71.60 5.639266 seconds of system run time
% 71.37/71.60 [Run times include 6.95 seconds GC run time.]
% 71.37/71.60 0 calls to %EVAL
% 71.37/71.60 0 page faults and
% 71.37/71.60 5,015,148,704 bytes consed.
% 71.37/71.60 :PROOF-FOUND
% 71.37/71.60 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T05:42:39
% 71.37/71.60 :PROOF-FOUND
% 71.37/71.60 *
%------------------------------------------------------------------------------