TSTP Solution File: GRP193-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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:29 EDT 2022
% Result : Unsatisfiable 0.48s 0.64s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 10 ( 9 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p8_9b_2,hypothesis,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9b_2) ).
cnf(p8_9b_4,hypothesis,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9b_4) ).
cnf(p8_9b_5,hypothesis,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)))) = greatest_lower_bound(a,multiply(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9b_5) ).
cnf(25,plain,
greatest_lower_bound(c,greatest_lower_bound(multiply(b,c),a)) = greatest_lower_bound(a,multiply(b,c)),
inference('REWRITE',[status(thm)],[p8_9b_5,idempotence_of_gld,left_identity,p8_9b_4,theory(equality)]) ).
cnf(prove_p8_9b,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p8_9b) ).
cnf(136,plain,
X = greatest_lower_bound(X,multiply(b,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,p8_9b_2,theory(equality)]),left_identity,theory(equality)]) ).
cnf(138,plain,
$false,
inference('REWRITE',[status(thm)],[25,prove_p8_9b,136,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 09:07:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T09:07:23
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-06-14T09:07:23
% 0.21/0.49
% 0.21/0.49 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.21/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.21/0.49 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.21/0.49 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.21/0.49 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.21/0.49 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.21/0.49 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.21/0.49 ; Declaring greatest_lower_bound to be commutative.
% 0.21/0.49 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.21/0.49 ; Declaring least_upper_bound to be commutative.
% 0.48/0.64 ; Declaring least_upper_bound to be associative-commutative.
% 0.48/0.64
% 0.48/0.64 #||
% 0.48/0.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.64 % SZS output start Refutation
% See solution above
% 0.48/0.64 ||#
% 0.48/0.64
% 0.48/0.64 ; Summary of computation:
% 0.48/0.64 ; 750 formulas have been input or derived (from 25 formulas).
% 0.48/0.64 ; 138 (18%) were retained. Of these,
% 0.48/0.64 ; 9 ( 7%) were simplified or subsumed later,
% 0.48/0.64 ; 129 (93%) are still being kept.
% 0.48/0.64 ;
% 0.48/0.64 ; Run time in seconds:
% 0.48/0.64 ; 0.004 3% Read assertion file (1 call)
% 0.48/0.64 ; 0.001 1% Assert (21 calls)
% 0.48/0.64 ; 0.015 9% Process new row (633 calls)
% 0.48/0.64 ; 0.003 2% Resolution (48 calls)
% 0.48/0.64 ; 0.017 11% Paramodulation (24 calls)
% 0.48/0.64 ; 0.002 1% Embedding (65 calls)
% 0.48/0.64 ; 0.083 53% Forward simplification (574 calls)
% 0.48/0.64 ; 0.005 3% Backward simplification (78 calls)
% 0.48/0.64 ; 0.002 1% Ordering (609 calls)
% 0.48/0.64 ; 0.001 1% Ordering ac (200 calls)
% 0.48/0.64 ; 0.001 1% Sortal reasoning (32 calls)
% 0.48/0.64 ; 0.000 0% Purity testing (1 call)
% 0.48/0.64 ; 0.024 15% Other
% 0.48/0.64 ; 0.158 Total
% 0.48/0.64 ; 0.159 Real time
% 0.48/0.64 ;
% 0.48/0.64 ; Term-hash-array has 406 terms in all.
% 0.48/0.64 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.48/0.64 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.48/0.64 ; Path-index has 393 entries (396 at peak, 413 added, 20 deleted).
% 0.48/0.64 ; Path-index has 320 nodes (320 at peak, 327 added, 7 deleted).
% 0.48/0.64 ; Trie-index has 393 entries (396 at peak, 413 added, 20 deleted).
% 0.48/0.64 ; Trie-index has 180 nodes (180 at peak, 199 added, 19 deleted).
% 0.48/0.64 ; Retrieved 56,807 generalization terms in 5,517 calls.
% 0.48/0.64 ; Retrieved 268 instance terms in 99 calls.
% 0.48/0.64 ; Retrieved 727 unifiable terms in 120 calls.
% 0.48/0.64 ;
% 0.48/0.64 ; The agenda of rows to process has 98 entries:
% 0.48/0.64 ; 3 with value 15 4 with value 23 7 with value 30
% 0.48/0.64 ; 2 with value 18 24 with value 24 2 with value 32
% 0.48/0.64 ; 2 with value 19 8 with value 26 2 with value 34
% 0.48/0.64 ; 28 with value 20 4 with value 27 1 with value 36
% 0.48/0.64 ; 7 with value 22 4 with value 28
% 0.48/0.64 ; The agenda of rows to give has 104 entries:
% 0.48/0.64 ; 6 with value (4 8) 11 with value (4 20) 4 with value (4 27)
% 0.48/0.64 ; 16 with value (4 11) 8 with value (4 21) 10 with value (4 28)
% 0.48/0.64 ; 1 with value (4 12) 4 with value (4 22) 4 with value (4 30)
% 0.48/0.64 ; 7 with value (4 15) 2 with value (4 23) 4 with value (4 31)
% 0.48/0.64 ; 6 with value (4 17) 4 with value (4 24) 4 with value (4 33)
% 0.48/0.64 ; 6 with value (4 18) 4 with value (4 25) 2 with value (4 36)
% 0.48/0.64 ; 1 with value (4 19)
% 0.48/0.64 Evaluation took:
% 0.48/0.64 0.159 seconds of real time
% 0.48/0.64 0.147065 seconds of user run time
% 0.48/0.64 0.012195 seconds of system run time
% 0.48/0.64 0 calls to %EVAL
% 0.48/0.64 0 page faults and
% 0.48/0.64 8,636,328 bytes consed.
% 0.48/0.64 :PROOF-FOUND
% 0.48/0.64 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T09:07:23
% 0.48/0.64 :PROOF-FOUND
% 0.48/0.64 *
%------------------------------------------------------------------------------