TSTP Solution File: GRP171-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP171-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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:17 EDT 2022
% Result : Unsatisfiable 0.74s 0.92s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 8 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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(p04a_1,hypothesis,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04a_1) ).
cnf(p04a_2,hypothesis,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04a_2) ).
cnf(19,plain,
least_upper_bound(identity,least_upper_bound(b,X)) = least_upper_bound(b,X),
inference('EMBED',[status(thm)],[p04a_2]) ).
cnf(prove_p04a,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04a) ).
cnf(107,plain,
multiply(a,X) = least_upper_bound(X,multiply(a,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_lub2,p04a_1,theory(equality)]),left_identity,theory(equality)]) ).
cnf(108,plain,
least_upper_bound(X,least_upper_bound(multiply(a,X),Y)) = least_upper_bound(multiply(a,X),Y),
inference('EMBED',[status(thm)],[107]) ).
cnf(371,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[19,108,theory(equality)]),prove_p04a,107,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP171-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n011.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 : Mon Jun 13 22:26:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T22:26:49
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-13T22:26:49
% 0.18/0.47
% 0.18/0.47 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.18/0.47 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.18/0.47 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.18/0.47 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.18/0.47 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.18/0.47 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.18/0.47 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.18/0.47 ; Declaring greatest_lower_bound to be commutative.
% 0.18/0.47 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.18/0.47 ; Declaring least_upper_bound to be commutative.
% 0.74/0.92 ; Declaring least_upper_bound to be associative-commutative.
% 0.74/0.92
% 0.74/0.92 #||
% 0.74/0.92 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.74/0.92 % SZS output start Refutation
% See solution above
% 0.74/0.92 ||#
% 0.74/0.92
% 0.74/0.92 ; Summary of computation:
% 0.74/0.92 ; 2364 formulas have been input or derived (from 48 formulas).
% 0.74/0.92 ; 371 (16%) were retained. Of these,
% 0.74/0.92 ; 60 (16%) were simplified or subsumed later,
% 0.74/0.92 ; 311 (84%) are still being kept.
% 0.74/0.92 ;
% 0.74/0.92 ; Run time in seconds:
% 0.74/0.92 ; 0.004 1% Read assertion file (1 call)
% 0.74/0.92 ; 0.000 0% Assert (18 calls)
% 0.74/0.92 ; 0.041 9% Process new row (2,160 calls)
% 0.74/0.92 ; 0.004 1% Resolution (94 calls)
% 0.74/0.92 ; 0.051 11% Paramodulation (47 calls)
% 0.74/0.92 ; 0.006 1% Embedding (177 calls)
% 0.74/0.92 ; 0.288 63% Forward simplification (1,987 calls)
% 0.74/0.92 ; 0.012 3% Backward simplification (198 calls)
% 0.74/0.92 ; 0.012 3% Ordering (2,168 calls)
% 0.74/0.92 ; 0.007 2% Ordering ac (672 calls)
% 0.74/0.92 ; 0.000 0% Sortal reasoning (32 calls)
% 0.74/0.92 ; 0.001 0% Purity testing (1 call)
% 0.74/0.92 ; 0.032 7% Other
% 0.74/0.92 ; 0.458 Total
% 0.74/0.92 ; 0.459 Real time
% 0.74/0.92 ;
% 0.74/0.92 ; Term-hash-array has 1,004 terms in all.
% 0.74/0.92 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.74/0.92 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.74/0.92 ; Path-index has 871 entries (880 at peak, 1,021 added, 150 deleted).
% 0.74/0.92 ; Path-index has 431 nodes (431 at peak, 456 added, 25 deleted).
% 0.74/0.92 ; Trie-index has 871 entries (880 at peak, 1,021 added, 150 deleted).
% 0.74/0.92 ; Trie-index has 312 nodes (312 at peak, 346 added, 34 deleted).
% 0.74/0.92 ; Retrieved 408,395 generalization terms in 20,943 calls.
% 0.74/0.92 ; Retrieved 561 instance terms in 221 calls.
% 0.74/0.92 ; Retrieved 4,252 unifiable terms in 239 calls.
% 0.74/0.92 ;
% 0.74/0.92 ; The agenda of rows to process has 136 entries:
% 0.74/0.92 ; 3 with value 17 11 with value 26 1 with value 34
% 0.74/0.92 ; 7 with value 18 5 with value 27 6 with value 35
% 0.74/0.92 ; 2 with value 19 4 with value 28 1 with value 36
% 0.74/0.92 ; 6 with value 20 3 with value 29 4 with value 37
% 0.74/0.92 ; 6 with value 21 14 with value 30 4 with value 39
% 0.74/0.92 ; 5 with value 22 3 with value 31 5 with value 41
% 0.74/0.92 ; 11 with value 23 2 with value 32 1 with value 43
% 0.74/0.92 ; 5 with value 24 15 with value 33 1 with value 49
% 0.74/0.92 ; 11 with value 25
% 0.74/0.92 ; The agenda of rows to give has 263 entries:
% 0.74/0.92 ; 17 with value (4 13) 25 with value (4 20) 4 with value (4 27)
% 0.74/0.92 ; 6 with value (4 14) 26 with value (4 21) 12 with value (4 28)
% 0.74/0.92 ; 13 with value (4 15) 28 with value (4 22) 4 with value (4 30)
% 0.74/0.92 ; 44 with value (4 16) 18 with value (4 23) 4 with value (4 31)
% 0.74/0.92 ; 12 with value (4 17) 12 with value (4 24) 4 with value (4 33)
% 0.74/0.92 ; 10 with value (4 18) 8 with value (4 25) 4 with value (4 36)
% 0.74/0.92 ; 8 with value (4 19) 4 with value (4 26)
% 0.74/0.92 Evaluation took:
% 0.74/0.92 0.461 seconds of real time
% 0.74/0.92 0.443079 seconds of user run time
% 0.74/0.92 0.015824 seconds of system run time
% 0.74/0.92 [Run times include 0.005 seconds GC run time.]
% 0.74/0.92 0 calls to %EVAL
% 0.74/0.92 0 page faults and
% 0.74/0.92 23,570,448 bytes consed.
% 0.74/0.92 :PROOF-FOUND
% 0.74/0.92 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T22:26:49
% 0.74/0.92 :PROOF-FOUND
% 0.74/0.92 *
%------------------------------------------------------------------------------