TSTP Solution File: GRP168-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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.52s 0.73s
% Output : Refutation 0.52s
% 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_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(p01b_1,hypothesis,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p01b_1) ).
cnf(prove_p01b,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p01b) ).
cnf(93,plain,
multiply(a,X) = greatest_lower_bound(multiply(a,X),multiply(b,X)),
inference('PARAMODULATE',[status(thm)],[monotony_glb2,p01b_1,theory(equality)]) ).
cnf(230,plain,
multiply(X,multiply(a,Y)) = greatest_lower_bound(multiply(X,multiply(a,Y)),multiply(X,multiply(b,Y))),
inference('PARAMODULATE',[status(thm)],[monotony_glb1,93,theory(equality)]) ).
cnf(232,plain,
$false,
inference('REWRITE',[status(thm)],[prove_p01b,230,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 18:46:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:46:52
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-06-13T18:46:52
% 0.19/0.49
% 0.19/0.49 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.19/0.49 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.19/0.49 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.19/0.49 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.19/0.49 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.19/0.49 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.19/0.49 ; Declaring greatest_lower_bound to be commutative.
% 0.19/0.49 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.19/0.49 ; Declaring least_upper_bound to be commutative.
% 0.52/0.73 ; Declaring least_upper_bound to be associative-commutative.
% 0.52/0.73
% 0.52/0.73 #||
% 0.52/0.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.73 % SZS output start Refutation
% See solution above
% 0.52/0.73 ||#
% 0.52/0.73
% 0.52/0.73 ; Summary of computation:
% 0.52/0.73 ; 1174 formulas have been input or derived (from 39 formulas).
% 0.52/0.73 ; 232 (20%) were retained. Of these,
% 0.52/0.73 ; 13 ( 6%) were simplified or subsumed later,
% 0.52/0.73 ; 219 (94%) are still being kept.
% 0.52/0.73 ;
% 0.52/0.73 ; Run time in seconds:
% 0.52/0.73 ; 0.004 2% Read assertion file (1 call)
% 0.52/0.73 ; 0.001 0% Assert (17 calls)
% 0.52/0.73 ; 0.033 13% Process new row (1,128 calls)
% 0.52/0.73 ; 0.000 0% Resolution (76 calls)
% 0.52/0.73 ; 0.029 11% Paramodulation (38 calls)
% 0.52/0.73 ; 0.004 2% Embedding (103 calls)
% 0.52/0.73 ; 0.135 53% Forward simplification (1,029 calls)
% 0.52/0.73 ; 0.008 3% Backward simplification (133 calls)
% 0.52/0.73 ; 0.006 2% Ordering (1,304 calls)
% 0.52/0.73 ; 0.005 2% Ordering ac (350 calls)
% 0.52/0.73 ; 0.000 0% Sortal reasoning (32 calls)
% 0.52/0.73 ; 0.000 0% Purity testing (1 call)
% 0.52/0.73 ; 0.028 11% Other
% 0.52/0.73 ; 0.253 Total
% 0.52/0.73 ; 0.258 Real time
% 0.52/0.73 ;
% 0.52/0.73 ; Term-hash-array has 731 terms in all.
% 0.52/0.73 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.52/0.73 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.52/0.73 ; Path-index has 699 entries (703 at peak, 740 added, 41 deleted).
% 0.52/0.73 ; Path-index has 497 nodes (507 at peak, 520 added, 23 deleted).
% 0.52/0.73 ; Trie-index has 699 entries (703 at peak, 740 added, 41 deleted).
% 0.52/0.73 ; Trie-index has 361 nodes (375 at peak, 419 added, 58 deleted).
% 0.52/0.73 ; Retrieved 112,500 generalization terms in 10,058 calls.
% 0.52/0.73 ; Retrieved 364 instance terms in 156 calls.
% 0.52/0.73 ; Retrieved 2,326 unifiable terms in 208 calls.
% 0.52/0.73 ;
% 0.52/0.73 ; The agenda of rows to process has 6 entries:
% 0.52/0.73 ; 2 with value 23 2 with value 25 2 with value 27
% 0.52/0.73 ; The agenda of rows to give has 181 entries:
% 0.52/0.73 ; 2 with value (4 15) 10 with value (4 22) 16 with value (4 28)
% 0.52/0.73 ; 8 with value (4 16) 20 with value (4 23) 4 with value (4 29)
% 0.52/0.73 ; 8 with value (4 17) 8 with value (4 24) 6 with value (4 30)
% 0.52/0.73 ; 14 with value (4 18) 14 with value (4 25) 4 with value (4 31)
% 0.52/0.73 ; 10 with value (4 19) 8 with value (4 26) 4 with value (4 33)
% 0.52/0.73 ; 13 with value (4 20) 10 with value (4 27) 6 with value (4 36)
% 0.52/0.73 ; 16 with value (4 21)
% 0.52/0.73 Evaluation took:
% 0.52/0.73 0.258 seconds of real time
% 0.52/0.73 0.239638 seconds of user run time
% 0.52/0.73 0.014896 seconds of system run time
% 0.52/0.73 [Run times include 0.007 seconds GC run time.]
% 0.52/0.73 0 calls to %EVAL
% 0.52/0.73 0 page faults and
% 0.52/0.73 13,413,600 bytes consed.
% 0.52/0.73 :PROOF-FOUND
% 0.52/0.73 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:46:53
% 0.52/0.73 :PROOF-FOUND
% 0.52/0.73 *
%------------------------------------------------------------------------------