TSTP Solution File: GRP170-4 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP170-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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.78s 0.93s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lub_absorbtion,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(p03d_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_1) ).
cnf(p03d_2,hypothesis,
greatest_lower_bound(c,d) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_2) ).
cnf(prove_p03d,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03d) ).
cnf(21,plain,
least_upper_bound(d,c) = d,
inference('PARAMODULATE',[status(thm)],[lub_absorbtion,p03d_2,theory(equality)]) ).
cnf(105,plain,
multiply(b,X) = least_upper_bound(multiply(a,X),multiply(b,X)),
inference('PARAMODULATE',[status(thm)],[monotony_lub2,p03d_1,theory(equality)]) ).
cnf(106,plain,
least_upper_bound(multiply(a,X),least_upper_bound(multiply(b,X),Y)) = least_upper_bound(multiply(b,X),Y),
inference('EMBED',[status(thm)],[105]) ).
cnf(119,plain,
multiply(X,d) = least_upper_bound(multiply(X,d),multiply(X,c)),
inference('PARAMODULATE',[status(thm)],[monotony_lub1,21,theory(equality)]) ).
cnf(120,plain,
least_upper_bound(multiply(X,d),least_upper_bound(multiply(X,c),Y)) = least_upper_bound(multiply(X,d),Y),
inference('EMBED',[status(thm)],[119]) ).
cnf(446,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[106,120,theory(equality)]),prove_p03d,119,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP170-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 22:11:06 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.49 *
% 0.22/0.49 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.50 *
% 0.22/0.50 "."
% 0.22/0.50 *
% 0.22/0.50 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T22:11:06
% 0.22/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-13T22:11:06
% 0.22/0.52
% 0.22/0.52 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.22/0.52 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.22/0.52 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.22/0.52 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.22/0.52 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.22/0.52 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.22/0.52 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.22/0.52 ; Declaring greatest_lower_bound to be commutative.
% 0.22/0.52 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.22/0.52 ; Declaring least_upper_bound to be commutative.
% 0.78/0.93 ; Declaring least_upper_bound to be associative-commutative.
% 0.78/0.93
% 0.78/0.93 #||
% 0.78/0.93 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.93 % SZS output start Refutation
% See solution above
% 0.78/0.93 ||#
% 0.78/0.93
% 0.78/0.93 ; Summary of computation:
% 0.78/0.93 ; 2292 formulas have been input or derived (from 63 formulas).
% 0.78/0.93 ; 446 (19%) were retained. Of these,
% 0.78/0.93 ; 30 ( 7%) were simplified or subsumed later,
% 0.78/0.93 ; 416 (93%) are still being kept.
% 0.78/0.93 ;
% 0.78/0.93 ; Run time in seconds excluding printing time:
% 0.78/0.93 ; 0.004 1% Read assertion file (1 call)
% 0.78/0.93 ; 0.001 0% Assert (18 calls)
% 0.78/0.93 ; 0.038 9% Process new row (2,150 calls)
% 0.78/0.93 ; 0.002 0% Resolution (124 calls)
% 0.78/0.93 ; 0.054 13% Paramodulation (62 calls)
% 0.78/0.93 ; 0.006 1% Embedding (210 calls)
% 0.78/0.93 ; 0.266 62% Forward simplification (1,944 calls)
% 0.78/0.93 ; 0.013 3% Backward simplification (240 calls)
% 0.78/0.93 ; 0.008 2% Ordering (2,990 calls)
% 0.78/0.93 ; 0.007 2% Ordering ac (935 calls)
% 0.78/0.93 ; 0.000 0% Sortal reasoning (32 calls)
% 0.78/0.93 ; 0.000 0% Purity testing (1 call)
% 0.78/0.93 ; 0.031 7% Other
% 0.78/0.93 ; 0.430 Total
% 0.78/0.93 ; 0.431 Real time
% 0.78/0.93 ;
% 0.78/0.93 ; Term-hash-array has 1,345 terms in all.
% 0.78/0.93 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.78/0.93 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.78/0.93 ; Path-index has 1,271 entries (1,271 at peak, 1,360 added, 89 deleted).
% 0.78/0.93 ; Path-index has 718 nodes (718 at peak, 730 added, 12 deleted).
% 0.78/0.93 ; Trie-index has 1,271 entries (1,271 at peak, 1,360 added, 89 deleted).
% 0.78/0.93 ; Trie-index has 553 nodes (553 at peak, 596 added, 43 deleted).
% 0.78/0.93 ; Retrieved 364,688 generalization terms in 18,468 calls.
% 0.78/0.93 ; Retrieved 523 instance terms in 263 calls.
% 0.78/0.93 ; Retrieved 8,165 unifiable terms in 344 calls.
% 0.78/0.93 ;
% 0.78/0.93 ; The agenda of rows to process has 62 entries:
% 0.78/0.93 ; 9 with value 21 3 with value 27 8 with value 33
% 0.78/0.93 ; 3 with value 23 3 with value 28 2 with value 34
% 0.78/0.93 ; 4 with value 24 18 with value 29 1 with value 35
% 0.78/0.93 ; 4 with value 25 3 with value 31 1 with value 38
% 0.78/0.93 ; 2 with value 26 1 with value 32
% 0.78/0.93 ; The agenda of rows to give has 353 entries:
% 0.78/0.93 ; 18 with value (4 16) 16 with value (4 22) 18 with value (4 28)
% 0.78/0.93 ; 16 with value (4 17) 54 with value (4 23) 8 with value (4 29)
% 0.78/0.93 ; 28 with value (4 18) 32 with value (4 24) 8 with value (4 30)
% 0.78/0.93 ; 42 with value (4 19) 28 with value (4 25) 4 with value (4 31)
% 0.78/0.93 ; 15 with value (4 20) 22 with value (4 26) 4 with value (4 33)
% 0.78/0.93 ; 18 with value (4 21) 14 with value (4 27) 8 with value (4 36)
% 0.78/0.93 Evaluation took:
% 0.78/0.93 0.432 seconds of real time
% 0.78/0.93 0.408744 seconds of user run time
% 0.78/0.93 0.023057 seconds of system run time
% 0.78/0.93 [Run times include 0.006 seconds GC run time.]
% 0.78/0.93 0 calls to %EVAL
% 0.78/0.93 0 page faults and
% 0.78/0.93 23,581,424 bytes consed.
% 0.78/0.93 :PROOF-FOUND
% 0.78/0.93 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T22:11:06
% 0.78/0.93 :PROOF-FOUND
% 0.78/0.93 *
%------------------------------------------------------------------------------