TSTP Solution File: GRP170-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP170-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:16 EDT 2022
% Result : Unsatisfiable 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 4 RR)
% Number of literals : 10 ( 9 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; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(monotony_glb1,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p03b_1,hypothesis,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03b_1) ).
cnf(p03b_2,hypothesis,
greatest_lower_bound(c,d) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03b_2) ).
cnf(prove_p03b,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p03b) ).
cnf(95,plain,
multiply(X,c) = greatest_lower_bound(multiply(X,c),multiply(X,d)),
inference('PARAMODULATE',[status(thm)],[monotony_glb1,p03b_2,theory(equality)]) ).
cnf(96,plain,
greatest_lower_bound(multiply(X,c),greatest_lower_bound(multiply(X,d),Y)) = greatest_lower_bound(multiply(X,c),Y),
inference('EMBED',[status(thm)],[95]) ).
cnf(111,plain,
multiply(a,X) = greatest_lower_bound(multiply(a,X),multiply(b,X)),
inference('PARAMODULATE',[status(thm)],[monotony_glb2,p03b_1,theory(equality)]) ).
cnf(112,plain,
greatest_lower_bound(multiply(a,X),greatest_lower_bound(multiply(b,X),Y)) = greatest_lower_bound(multiply(a,X),Y),
inference('EMBED',[status(thm)],[111]) ).
cnf(382,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[96,112,theory(equality)]),prove_p03b,111,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP170-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.02/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n018.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 : Tue Jun 14 01:21:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T01:21:13
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-14T01:21:13
% 0.19/0.47
% 0.19/0.47 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.47 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.19/0.47 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.19/0.47 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.19/0.47 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.19/0.47 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.19/0.47 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.19/0.47 ; Declaring greatest_lower_bound to be commutative.
% 0.19/0.47 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.19/0.47 ; Declaring least_upper_bound to be commutative.
% 0.61/0.82 ; Declaring least_upper_bound to be associative-commutative.
% 0.61/0.82
% 0.61/0.82 #||
% 0.61/0.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.82 % SZS output start Refutation
% See solution above
% 0.61/0.83 ||#
% 0.61/0.83
% 0.61/0.83 ; Summary of computation:
% 0.61/0.83 ; 2023 formulas have been input or derived (from 56 formulas).
% 0.61/0.83 ; 382 (19%) were retained. Of these,
% 0.61/0.83 ; 26 ( 7%) were simplified or subsumed later,
% 0.61/0.83 ; 356 (93%) are still being kept.
% 0.61/0.83 ;
% 0.61/0.83 ; Run time in seconds:
% 0.61/0.83 ; 0.004 1% Read assertion file (1 call)
% 0.61/0.83 ; 0.001 0% Assert (18 calls)
% 0.61/0.83 ; 0.043 12% Process new row (1,885 calls)
% 0.61/0.83 ; 0.002 1% Resolution (110 calls)
% 0.61/0.83 ; 0.043 12% Paramodulation (55 calls)
% 0.61/0.83 ; 0.004 1% Embedding (178 calls)
% 0.61/0.83 ; 0.220 60% Forward simplification (1,711 calls)
% 0.61/0.83 ; 0.005 1% Backward simplification (208 calls)
% 0.61/0.83 ; 0.006 2% Ordering (2,410 calls)
% 0.61/0.83 ; 0.004 1% Ordering ac (774 calls)
% 0.61/0.83 ; 0.000 0% Sortal reasoning (32 calls)
% 0.61/0.83 ; 0.000 0% Purity testing (1 call)
% 0.61/0.83 ; 0.035 10% Other
% 0.61/0.83 ; 0.367 Total
% 0.61/0.83 ; 0.368 Real time
% 0.61/0.83 ;
% 0.61/0.83 ; Term-hash-array has 1,169 terms in all.
% 0.61/0.83 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.61/0.83 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.61/0.83 ; Path-index has 1,107 entries (1,110 at peak, 1,183 added, 76 deleted).
% 0.61/0.83 ; Path-index has 642 nodes (642 at peak, 654 added, 12 deleted).
% 0.61/0.83 ; Trie-index has 1,107 entries (1,110 at peak, 1,183 added, 76 deleted).
% 0.61/0.83 ; Trie-index has 484 nodes (484 at peak, 527 added, 43 deleted).
% 0.61/0.83 ; Retrieved 295,078 generalization terms in 16,127 calls.
% 0.61/0.83 ; Retrieved 475 instance terms in 231 calls.
% 0.61/0.83 ; Retrieved 6,213 unifiable terms in 301 calls.
% 0.61/0.83 ;
% 0.61/0.83 ; The agenda of rows to process has 64 entries:
% 0.61/0.83 ; 8 with value 20 2 with value 26 8 with value 32
% 0.61/0.83 ; 3 with value 22 5 with value 27 3 with value 33
% 0.61/0.83 ; 4 with value 23 17 with value 28 1 with value 34
% 0.61/0.83 ; 4 with value 24 3 with value 30 2 with value 37
% 0.61/0.83 ; 2 with value 25 2 with value 31
% 0.61/0.83 ; The agenda of rows to give has 300 entries:
% 0.61/0.83 ; 1 with value (4 15) 18 with value (4 22) 16 with value (4 28)
% 0.61/0.83 ; 22 with value (4 16) 50 with value (4 23) 10 with value (4 29)
% 0.61/0.83 ; 14 with value (4 17) 8 with value (4 24) 8 with value (4 30)
% 0.61/0.83 ; 26 with value (4 18) 26 with value (4 25) 4 with value (4 31)
% 0.61/0.83 ; 26 with value (4 19) 14 with value (4 26) 4 with value (4 33)
% 0.61/0.83 ; 15 with value (4 20) 12 with value (4 27) 8 with value (4 36)
% 0.61/0.83 ; 18 with value (4 21)
% 0.61/0.83 Evaluation took:
% 0.61/0.83 0.368 seconds of real time
% 0.61/0.83 0.348527 seconds of user run time
% 0.61/0.83 0.020058 seconds of system run time
% 0.61/0.83 [Run times include 0.005 seconds GC run time.]
% 0.61/0.83 0 calls to %EVAL
% 0.61/0.83 0 page faults and
% 0.61/0.83 20,968,352 bytes consed.
% 0.61/0.83 :PROOF-FOUND
% 0.61/0.83 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T01:21:13
% 0.61/0.83 :PROOF-FOUND
% 0.61/0.83 *
%------------------------------------------------------------------------------