TSTP Solution File: COL079-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COL079-2 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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:48 EDT 2022
% Result : Unsatisfiable 2.19s 2.38s
% Output : Refutation 2.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 10 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 11 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 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 : 21 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_definition,axiom,
apply(k(X),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_definition) ).
cnf(abstraction,axiom,
apply(apply(apply(abstraction,X),Y),Z) = apply(apply(X,k(Z)),apply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',abstraction) ).
cnf(extensionality2,axiom,
( X = Y
| apply(X,n(X,Y)) != apply(Y,n(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality2) ).
cnf(prove_TRC2a,negated_conjecture,
apply(abstraction,apply(abstraction,apply(abstraction,b))) != apply(abstraction,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_TRC2a) ).
cnf(8,plain,
apply(apply(abstraction,b),n(apply(abstraction,b),apply(abstraction,apply(abstraction,apply(abstraction,b))))) != apply(apply(abstraction,apply(abstraction,apply(abstraction,b))),n(apply(abstraction,b),apply(abstraction,apply(abstraction,apply(abstraction,b))))),
inference('UR-RESOLVE',[status(thm)],[extensionality2,prove_TRC2a]) ).
cnf(10,plain,
apply(apply(apply(abstraction,X),k(Y)),Z) = apply(apply(X,k(Z)),Y),
inference('PARAMODULATE',[status(thm)],[abstraction,k_definition,theory(equality)]) ).
cnf(12,plain,
apply(apply(apply(abstraction,apply(abstraction,X)),Y),Z) = apply(apply(X,k(apply(Y,Z))),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[abstraction,abstraction,theory(equality)]),k_definition,theory(equality)]) ).
cnf(162,plain,
apply(apply(apply(abstraction,apply(abstraction,apply(abstraction,X))),Y),Z) = apply(apply(X,k(Z)),apply(Y,Z)),
inference('PARAMODULATE',[status(thm)],[10,12,theory(equality)]) ).
cnf(1317,plain,
apply(apply(apply(abstraction,X),Y),Z) = apply(apply(apply(abstraction,apply(abstraction,apply(abstraction,X))),Y),Z),
inference('PARAMODULATE',[status(thm)],[abstraction,162,theory(equality)]) ).
cnf(1348,plain,
apply(apply(abstraction,X),Y) = apply(apply(abstraction,apply(abstraction,apply(abstraction,X))),Y),
inference('HYPERRESOLVE',[status(thm)],[extensionality2,1317]) ).
cnf(1349,plain,
$false,
inference('REWRITE',[status(thm)],[8,1348,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL079-2 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n023.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 14:38:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-05-31T14:38:56
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-05-31T14:38:56
% 2.19/2.38
% 2.19/2.38
% 2.19/2.38 #||
% 2.19/2.38 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/2.38 % SZS output start Refutation
% See solution above
% 2.19/2.39 ||#
% 2.19/2.39
% 2.19/2.39 ; Summary of computation:
% 2.19/2.39 ; 3385 formulas have been input or derived (from 54 formulas).
% 2.19/2.39 ; 1349 (40%) were retained. Of these,
% 2.19/2.39 ; 90 ( 7%) were simplified or subsumed later,
% 2.19/2.39 ; 1259 (93%) are still being kept.
% 2.19/2.39 ;
% 2.19/2.39 ; Run time in seconds excluding printing time:
% 2.19/2.39 ; 0.002 0% Read assertion file (1 call)
% 2.19/2.39 ; 0.000 0% Assert (4 calls)
% 2.19/2.39 ; 0.201 10% Process new row (3,115 calls)
% 2.19/2.39 ; 0.016 1% Resolution (106 calls)
% 2.19/2.39 ; 0.060 3% Paramodulation (53 calls)
% 2.19/2.39 ; 0.001 0% Condensing (95 calls)
% 2.19/2.39 ; 0.007 0% Forward subsumption (95 calls)
% 2.19/2.39 ; 0.003 0% Backward subsumption (63 calls)
% 2.19/2.39 ; 0.009 0% Clause clause subsumption (264 calls)
% 2.19/2.39 ; 0.431 23% Forward simplification (2,744 calls)
% 2.19/2.39 ; 0.101 5% Backward simplification (1,349 calls)
% 2.19/2.39 ; 1.049 55% Ordering (124,963 calls)
% 2.19/2.39 ; 0.000 0% Sortal reasoning (32 calls)
% 2.19/2.39 ; 0.000 0% Purity testing (1 call)
% 2.19/2.39 ; 0.035 2% Other
% 2.19/2.39 ; 1.915 Total
% 2.19/2.39 ; 1.917 Real time
% 2.19/2.39 ;
% 2.19/2.39 ; Term-hash-array has 5,412 terms in all.
% 2.19/2.39 ; Feature-vector-row-index has 63 entries (63 at peak, 63 added, 0 deleted).
% 2.19/2.39 ; Feature-vector-row-index has 486 nodes (486 at peak, 486 added, 0 deleted).
% 2.19/2.39 ; Retrieved 234 possibly forward subsuming rows in 95 calls.
% 2.19/2.39 ; Retrieved 50 possibly backward subsumed rows in 63 calls.
% 2.19/2.39 ; Path-index has 5,132 entries (5,181 at peak, 5,441 added, 309 deleted).
% 2.19/2.39 ; Path-index has 3,948 nodes (4,010 at peak, 4,020 added, 72 deleted).
% 2.19/2.39 ; Trie-index has 5,132 entries (5,181 at peak, 5,441 added, 309 deleted).
% 2.19/2.39 ; Trie-index has 32,242 nodes (32,641 at peak, 34,095 added, 1,853 deleted).
% 2.19/2.39 ; Retrieved 115,437 generalization terms in 37,028 calls.
% 2.19/2.39 ; Retrieved 22,480 instance terms in 3,359 calls.
% 2.19/2.39 ; Retrieved 24,918 unifiable terms in 648 calls.
% 2.19/2.39 ;
% 2.19/2.39 ; The agenda of backward simplifiable rows to process has 1 entry:
% 2.19/2.39 ; 1 with value 0
% 2.19/2.39 ; The agenda of rows to process has 69 entries:
% 2.19/2.39 ; 1 with value 25 3 with value 36 3 with value 45
% 2.19/2.39 ; 2 with value 27 2 with value 37 2 with value 46
% 2.19/2.39 ; 2 with value 28 4 with value 38 1 with value 47
% 2.19/2.39 ; 1 with value 29 7 with value 39 2 with value 48
% 2.19/2.39 ; 2 with value 31 2 with value 40 1 with value 49
% 2.19/2.39 ; 2 with value 32 4 with value 41 2 with value 50
% 2.19/2.39 ; 1 with value 33 6 with value 42 3 with value 51
% 2.19/2.39 ; 2 with value 34 4 with value 43 2 with value 52
% 2.19/2.39 ; 2 with value 35 4 with value 44 2 with value 58
% 2.19/2.39 ; The agenda of rows to give has 1215 entries:
% 2.19/2.39 ; 1 with value (4 24) 95 with value (4 39) 26 with value (4 50)
% 2.19/2.39 ; 14 with value (4 29) 86 with value (4 40) 19 with value (4 51)
% 2.19/2.39 ; 9 with value (4 30) 89 with value (4 41) 14 with value (4 52)
% 2.19/2.39 ; 28 with value (4 31) 84 with value (4 42) 3 with value (4 53)
% 2.19/2.39 ; 32 with value (4 32) 81 with value (4 43) 7 with value (4 54)
% 2.19/2.39 ; 37 with value (4 33) 74 with value (4 44) 5 with value (4 55)
% 2.19/2.39 ; 49 with value (4 34) 54 with value (4 45) 2 with value (4 56)
% 2.19/2.39 ; 50 with value (4 35) 39 with value (4 46) 5 with value (4 60)
% 2.19/2.39 ; 72 with value (4 36) 29 with value (4 47) 3 with value (4 62)
% 2.19/2.39 ; 57 with value (4 37) 32 with value (4 48) 1 with value (4 63)
% 2.19/2.39 ; 96 with value (4 38) 20 with value (4 49) 2 with value (4 67)
% 2.19/2.39 Evaluation took:
% 2.19/2.39 1.917 seconds of real time
% 2.19/2.39 1.73406 seconds of user run time
% 2.19/2.39 0.183155 seconds of system run time
% 2.19/2.39 [Run times include 0.112 seconds GC run time.]
% 2.19/2.39 0 calls to %EVAL
% 2.19/2.39 0 page faults and
% 2.19/2.39 120,164,776 bytes consed.
% 2.19/2.39 :PROOF-FOUND
% 2.19/2.39 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T14:38:58
% 2.19/2.39 :PROOF-FOUND
% 2.19/2.39 *
%------------------------------------------------------------------------------