%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COL064-4 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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:45 EDT 2022
% Result : Unsatisfiable 119.69s 119.91s
% Output : Refutation 119.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 5 RR)
% Number of literals : 24 ( 23 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_definition,axiom,
apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(t_definition,axiom,
apply(apply(t,X),Y) = apply(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).
cnf(prove_v_combinator,negated_conjecture,
apply(apply(apply(apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,apply(apply(b,b),b)),t)),x),y),z) != apply(apply(z,x),y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_combinator) ).
cnf(4,plain,
apply(apply(apply(apply(apply(apply(apply(b,b),t),apply(apply(b,b),t)),apply(apply(b,apply(apply(b,b),b)),t)),x),y),z) != apply(apply(z,x),y),
inference('REWRITE',[status(thm)],[prove_v_combinator,b_definition,theory(equality)]) ).
cnf(5,plain,
apply(apply(apply(b,X),apply(t,Y)),Z) = apply(X,apply(Z,Y)),
inference('PARAMODULATE',[status(thm)],[b_definition,t_definition,theory(equality)]) ).
cnf(7,plain,
apply(apply(apply(b,apply(t,X)),Y),Z) = apply(apply(Y,Z),X),
inference('PARAMODULATE',[status(thm)],[t_definition,b_definition,theory(equality)]) ).
cnf(8,plain,
apply(apply(apply(apply(apply(apply(b,b),b),apply(t,z)),apply(b,apply(t,y))),apply(apply(b,apply(t,x)),apply(apply(apply(b,b),t),apply(apply(b,b),t)))),apply(apply(b,apply(apply(b,b),b)),t)) != apply(apply(z,x),y),
inference('REWRITE',[status(thm)],[4,b_definition,7,theory(equality)]) ).
cnf(9,plain,
apply(apply(apply(b,X),apply(apply(b,Y),Z)),U) = apply(X,apply(Y,apply(Z,U))),
inference('PARAMODULATE',[status(thm)],[b_definition,b_definition,theory(equality)]) ).
cnf(11,plain,
apply(apply(apply(b,apply(apply(b,X),Y)),Z),U) = apply(X,apply(Y,apply(Z,U))),
inference('PARAMODULATE',[status(thm)],[b_definition,b_definition,theory(equality)]) ).
cnf(12,plain,
apply(apply(apply(apply(apply(b,b),X),Y),Z),U) = apply(apply(X,Y),apply(Z,U)),
inference('PARAMODULATE',[status(thm)],[b_definition,b_definition,theory(equality)]) ).
cnf(17,plain,
apply(apply(apply(b,X),Y),Z) = apply(apply(apply(b,X),apply(t,Z)),Y),
inference('PARAMODULATE',[status(thm)],[b_definition,5,theory(equality)]) ).
cnf(19,plain,
apply(apply(apply(b,apply(t,X)),apply(t,Y)),Z) = apply(apply(Z,Y),X),
inference('PARAMODULATE',[status(thm)],[t_definition,5,theory(equality)]) ).
cnf(24,plain,
apply(apply(apply(b,X),apply(apply(b,Y),apply(t,Z))),U) = apply(X,apply(Y,apply(U,Z))),
inference('PARAMODULATE',[status(thm)],[b_definition,5,theory(equality)]) ).
cnf(25,plain,
apply(apply(apply(b,X),Y),apply(Z,U)) = apply(X,apply(apply(apply(b,Y),apply(t,U)),Z)),
inference('PARAMODULATE',[status(thm)],[b_definition,5,theory(equality)]) ).
cnf(52,plain,
apply(apply(apply(apply(apply(b,b),t),X),Y),Z) = apply(apply(Y,Z),X),
inference('PARAMODULATE',[status(thm)],[7,b_definition,theory(equality)]) ).
cnf(85,plain,
apply(apply(apply(b,apply(t,X)),apply(b,Y)),Z) = apply(apply(apply(b,Y),apply(t,X)),Z),
inference('PARAMODULATE',[status(thm)],[7,17,theory(equality)]) ).
cnf(140,plain,
apply(X,apply(Y,apply(Z,U))) = apply(X,apply(apply(apply(b,Y),Z),U)),
inference('PARAMODULATE',[status(thm)],[b_definition,9,theory(equality)]) ).
cnf(142,plain,
apply(apply(apply(b,X),Y),apply(Z,U)) = apply(apply(apply(b,X),apply(apply(b,Y),Z)),U),
inference('PARAMODULATE',[status(thm)],[b_definition,9,theory(equality)]) ).
cnf(796,plain,
apply(apply(apply(apply(apply(b,b),t),X),apply(apply(b,apply(apply(b,Y),Z)),U)),V) = apply(apply(Y,apply(Z,apply(U,V))),X),
inference('PARAMODULATE',[status(thm)],[52,11,theory(equality)]) ).
cnf(2373,plain,
apply(apply(apply(apply(apply(b,b),X),apply(Y,Z)),apply(apply(b,U),V)),W) = apply(apply(apply(apply(b,X),apply(t,Z)),Y),apply(U,apply(V,W))),
inference('PARAMODULATE',[status(thm)],[9,25,theory(equality)]) ).
cnf(3541,plain,
apply(apply(apply(b,X),apply(apply(b,Y),Z)),apply(U,V)) = apply(apply(apply(b,X),Y),apply(apply(apply(b,Z),U),V)),
inference('PARAMODULATE',[status(thm)],[140,142,theory(equality)]) ).
cnf(3561,plain,
apply(apply(apply(b,X),Y),apply(Z,U)) = apply(apply(apply(apply(apply(apply(b,b),b),X),apply(b,Y)),Z),U),
inference('PARAMODULATE',[status(thm)],[142,12,theory(equality)]) ).
cnf(3562,plain,
apply(apply(apply(b,apply(t,z)),apply(apply(b,apply(t,y)),apply(t,x))),apply(apply(apply(apply(b,b),t),apply(apply(b,b),t)),apply(apply(b,apply(apply(b,b),b)),t))) != apply(apply(z,x),y),
inference('REWRITE',[status(thm)],[8,3541,3561,theory(equality)]) ).
cnf(3770,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3562,24,theory(equality)]),19,85,17,2373,t_definition,b_definition,796,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL064-4 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n021.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 : Tue May 31 12:22:29 EDT 2022
% 0.13/0.35 % 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-05-31T12:22:30
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-05-31T12:22:30
% 119.69/119.91
% 119.69/119.91
% 119.69/119.91 #||
% 119.69/119.91 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 119.69/119.91 % SZS output start Refutation
% See solution above
% 119.69/119.91 ||#
% 119.69/119.91
% 119.69/119.91 ; Summary of computation:
% 119.69/119.91 ; 7357 formulas have been input or derived (from 39 formulas).
% 119.69/119.91 ; 3770 (51%) were retained. Of these,
% 119.69/119.91 ; 145 ( 4%) were simplified or subsumed later,
% 119.69/119.91 ; 3625 (96%) are still being kept.
% 119.69/119.91 ;
% 119.69/119.91 ; Run time in seconds excluding printing time:
% 119.69/119.91 ; 0.001 0% Read assertion file (1 call)
% 119.69/119.91 ; 0.000 0% Assert (3 calls)
% 119.69/119.91 ; 0.887 1% Process new row (7,199 calls)
% 119.69/119.91 ; 0.019 0% Resolution (76 calls)
% 119.69/119.91 ; 0.205 0% Paramodulation (38 calls)
% 119.69/119.91 ; 15.971 13% Forward simplification (6,552 calls)
% 119.69/119.91 ; 5.436 5% Backward simplification (3,769 calls)
% 119.69/119.91 ; 96.814 81% Ordering (9,477,495 calls)
% 119.69/119.91 ; 0.001 0% Sortal reasoning (32 calls)
% 119.69/119.91 ; 0.001 0% Purity testing (1 call)
% 119.69/119.91 ; 0.086 0% Other
% 119.69/119.91 ; 119.421 Total
% 119.69/119.91 ; 119.432 Real time
% 119.69/119.91 ;
% 119.69/119.91 ; Term-hash-array has 12,659 terms in all.
% 119.69/119.91 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 119.69/119.91 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 119.69/119.91 ; Path-index has 12,195 entries (12,195 at peak, 12,831 added, 636 deleted).
% 119.69/119.91 ; Path-index has 2,085 nodes (2,085 at peak, 2,505 added, 420 deleted).
% 119.69/119.91 ; Trie-index has 12,195 entries (12,195 at peak, 12,831 added, 636 deleted).
% 119.69/119.91 ; Trie-index has 65,190 nodes (65,190 at peak, 72,689 added, 7,499 deleted).
% 119.69/119.91 ; Retrieved 2,272,833 generalization terms in 94,691 calls.
% 119.69/119.91 ; Retrieved 1,471,210 instance terms in 11,044 calls.
% 119.69/119.91 ; Retrieved 117,874 unifiable terms in 475 calls.
% 119.69/119.91 ;
% 119.69/119.91 ; The agenda of rows to process has 131 entries:
% 119.69/119.91 ; 1 with value 49 13 with value 56 7 with value 63
% 119.69/119.91 ; 2 with value 50 12 with value 57 3 with value 64
% 119.69/119.91 ; 1 with value 51 11 with value 58 1 with value 65
% 119.69/119.91 ; 3 with value 52 15 with value 59 1 with value 66
% 119.69/119.91 ; 5 with value 53 13 with value 60 1 with value 67
% 119.69/119.91 ; 4 with value 54 15 with value 61 1 with value 71
% 119.69/119.91 ; 6 with value 55 15 with value 62 1 with value 72
% 119.69/119.91 ; The agenda of rows to give has 3589 entries:
% 119.69/119.91 ; 2 with value (4 28) 276 with value (4 44) 2 with value (4 60)
% 119.69/119.91 ; 23 with value (4 29) 220 with value (4 45) 1 with value (4 80)
% 119.69/119.91 ; 18 with value (4 30) 108 with value (4 46) 1 with value (4 81)
% 119.69/119.91 ; 44 with value (4 31) 64 with value (4 47) 1 with value (4 83)
% 119.69/119.91 ; 50 with value (4 32) 37 with value (4 48) 1 with value (4 84)
% 119.69/119.91 ; 61 with value (4 33) 29 with value (4 49) 1 with value (4 87)
% 119.69/119.91 ; 110 with value (4 34) 24 with value (4 50) 1 with value (4 88)
% 119.69/119.91 ; 164 with value (4 35) 10 with value (4 51) 1 with value (4 90)
% 119.69/119.91 ; 187 with value (4 36) 18 with value (4 52) 2 with value (4 91)
% 119.69/119.91 ; 188 with value (4 37) 6 with value (4 53) 1 with value (4 97)
% 119.69/119.91 ; 255 with value (4 38) 6 with value (4 54) 1 with value (4 100)
% 119.69/119.91 ; 319 with value (4 39) 4 with value (4 55) 1 with value (4 110)
% 119.69/119.91 ; 369 with value (4 40) 3 with value (4 56) 1 with value (4 113)
% 119.69/119.91 ; 339 with value (4 41) 4 with value (4 57) 1 with value (4 114)
% 119.69/119.91 ; 298 with value (4 42) 2 with value (4 58) 1 with value (4 115)
% 119.69/119.91 ; 334 with value (4 43)
% 119.69/119.91 Evaluation took:
% 119.69/119.91 119.433 seconds of real time
% 119.69/119.91 108.666725 seconds of user run time
% 119.69/119.91 10.75812 seconds of system run time
% 119.69/119.91 [Run times include 6.163 seconds GC run time.]
% 119.69/119.91 0 calls to %EVAL
% 119.69/119.91 0 page faults and
% 119.69/119.91 7,793,255,872 bytes consed.
% 119.69/119.91 :PROOF-FOUND
% 119.69/119.91 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T12:24:29
% 119.69/119.92 :PROOF-FOUND
% 119.69/119.92 *
%------------------------------------------------------------------------------