TSTP Solution File: GRP168-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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 : Sat Jul 16 11:37:15 EDT 2022
% Result : Unsatisfiable 0.42s 0.77s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 3 RR)
% Number of literals : 7 ( 6 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(p01a_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p01a_1) ).
cnf(prove_p01a,negated_conjecture,
least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p01a) ).
cnf(89,plain,
multiply(b,X) = least_upper_bound(multiply(a,X),multiply(b,X)),
inference('PARAMODULATE',[status(thm)],[monotony_lub2,p01a_1,theory(equality)]) ).
cnf(228,plain,
multiply(X,multiply(b,Y)) = least_upper_bound(multiply(X,multiply(a,Y)),multiply(X,multiply(b,Y))),
inference('PARAMODULATE',[status(thm)],[monotony_lub1,89,theory(equality)]) ).
cnf(230,plain,
$false,
inference('REWRITE',[status(thm)],[prove_p01a,228,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.16 % Problem : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.18 % Command : run-snark %s %d
% 0.11/0.41 % Computer : n013.cluster.edu
% 0.11/0.41 % Model : x86_64 x86_64
% 0.11/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41 % Memory : 8042.1875MB
% 0.11/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.41 % CPULimit : 300
% 0.11/0.41 % WCLimit : 600
% 0.11/0.41 % DateTime : Mon Jun 13 23:54:59 EDT 2022
% 0.11/0.42 % CPUTime :
% 0.16/0.52 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.52 *
% 0.16/0.53 *
% 0.16/0.53 #<PACKAGE "SNARK-USER">
% 0.16/0.53 *
% 0.16/0.53 SNARK-TPTP-OPTIONS
% 0.16/0.53 *
% 0.16/0.53 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.16/0.53 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.16/0.53 (USE-FACTORING :POS)
% 0.16/0.53 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.16/0.53 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.16/0.53 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.16/0.53 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.16/0.53 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.16/0.53 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.16/0.53 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.16/0.53 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.16/0.53 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.16/0.53 (DECLARE-TPTP-SYMBOLS2))
% 0.16/0.53 *
% 0.16/0.53 "."
% 0.16/0.53 *
% 0.16/0.53 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:54:59
% 0.16/0.53 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-13T23:54:59
% 0.16/0.54
% 0.16/0.54 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.16/0.54 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.16/0.54 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.16/0.54 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.16/0.54 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.16/0.54 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.16/0.54 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.16/0.54 ; Declaring greatest_lower_bound to be commutative.
% 0.16/0.54 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.16/0.54 ; Declaring least_upper_bound to be commutative.
% 0.42/0.77 ; Declaring least_upper_bound to be associative-commutative.
% 0.42/0.77
% 0.42/0.77 #||
% 0.42/0.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.77 % SZS output start Refutation
% See solution above
% 0.42/0.77 ||#
% 0.42/0.77
% 0.42/0.77 ; Summary of computation:
% 0.42/0.77 ; 1173 formulas have been input or derived (from 39 formulas).
% 0.42/0.77 ; 230 (20%) were retained. Of these,
% 0.42/0.77 ; 13 ( 6%) were simplified or subsumed later,
% 0.42/0.77 ; 217 (94%) are still being kept.
% 0.42/0.77 ;
% 0.42/0.77 ; Run time in seconds excluding printing time:
% 0.42/0.77 ; 0.002 1% Read assertion file (1 call)
% 0.42/0.77 ; 0.000 0% Assert (17 calls)
% 0.42/0.77 ; 0.023 10% Process new row (1,127 calls)
% 0.42/0.77 ; 0.000 0% Resolution (76 calls)
% 0.42/0.77 ; 0.030 13% Paramodulation (38 calls)
% 0.42/0.77 ; 0.003 1% Embedding (102 calls)
% 0.42/0.77 ; 0.142 61% Forward simplification (1,029 calls)
% 0.42/0.77 ; 0.007 3% Backward simplification (132 calls)
% 0.42/0.77 ; 0.003 1% Ordering (1,302 calls)
% 0.42/0.77 ; 0.005 2% Ordering ac (351 calls)
% 0.42/0.77 ; 0.000 0% Sortal reasoning (32 calls)
% 0.42/0.77 ; 0.000 0% Purity testing (1 call)
% 0.42/0.77 ; 0.017 7% Other
% 0.42/0.77 ; 0.232 Total
% 0.42/0.77 ; 0.236 Real time
% 0.42/0.77 ;
% 0.42/0.77 ; Term-hash-array has 724 terms in all.
% 0.42/0.77 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.42/0.77 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.42/0.77 ; Path-index has 692 entries (696 at peak, 733 added, 41 deleted).
% 0.42/0.77 ; Path-index has 487 nodes (497 at peak, 510 added, 23 deleted).
% 0.42/0.77 ; Trie-index has 692 entries (696 at peak, 733 added, 41 deleted).
% 0.42/0.77 ; Trie-index has 361 nodes (375 at peak, 419 added, 58 deleted).
% 0.42/0.77 ; Retrieved 113,129 generalization terms in 10,072 calls.
% 0.42/0.77 ; Retrieved 367 instance terms in 155 calls.
% 0.42/0.77 ; Retrieved 2,315 unifiable terms in 208 calls.
% 0.42/0.77 ;
% 0.42/0.77 ; The agenda of rows to process has 6 entries:
% 0.42/0.77 ; 2 with value 23 2 with value 25 2 with value 27
% 0.42/0.77 ; The agenda of rows to give has 179 entries:
% 0.42/0.77 ; 2 with value (4 15) 10 with value (4 22) 16 with value (4 28)
% 0.42/0.77 ; 8 with value (4 16) 20 with value (4 23) 2 with value (4 29)
% 0.42/0.77 ; 8 with value (4 17) 8 with value (4 24) 6 with value (4 30)
% 0.42/0.77 ; 14 with value (4 18) 14 with value (4 25) 4 with value (4 31)
% 0.42/0.77 ; 10 with value (4 19) 8 with value (4 26) 4 with value (4 33)
% 0.42/0.77 ; 13 with value (4 20) 10 with value (4 27) 6 with value (4 36)
% 0.42/0.77 ; 16 with value (4 21)
% 0.42/0.77 Evaluation took:
% 0.42/0.77 0.237 seconds of real time
% 0.42/0.77 0.217187 seconds of user run time
% 0.42/0.77 0.017101 seconds of system run time
% 0.42/0.77 [Run times include 0.008 seconds GC run time.]
% 0.42/0.77 0 calls to %EVAL
% 0.42/0.77 0 page faults and
% 0.42/0.77 13,369,656 bytes consed.
% 0.42/0.77 :PROOF-FOUND
% 0.42/0.77 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:54:59
% 0.42/0.77 :PROOF-FOUND
% 0.42/0.77 *
%------------------------------------------------------------------------------