TSTP Solution File: GRP172-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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.43s 0.65s
% Output : Refutation 0.43s
% 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_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(p04b_1,hypothesis,
greatest_lower_bound(identity,a) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04b_1) ).
cnf(p04b_2,hypothesis,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04b_2) ).
cnf(19,plain,
greatest_lower_bound(identity,greatest_lower_bound(b,X)) = greatest_lower_bound(identity,X),
inference('EMBED',[status(thm)],[p04b_2]) ).
cnf(prove_p04b,negated_conjecture,
greatest_lower_bound(identity,multiply(a,b)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04b) ).
cnf(111,plain,
X = greatest_lower_bound(X,multiply(a,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,p04b_1,theory(equality)]),left_identity,theory(equality)]) ).
cnf(112,plain,
greatest_lower_bound(X,greatest_lower_bound(multiply(a,X),Y)) = greatest_lower_bound(X,Y),
inference('EMBED',[status(thm)],[111]) ).
cnf(215,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[19,112,theory(equality)]),prove_p04b,p04b_2,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : run-snark %s %d
% 0.09/0.32 % Computer : n014.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8042.1875MB
% 0.09/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 300
% 0.09/0.32 % WCLimit : 600
% 0.09/0.32 % DateTime : Tue Jun 14 13:44:51 EDT 2022
% 0.09/0.32 % CPUTime :
% 0.14/0.42 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.43 *
% 0.14/0.43 *
% 0.14/0.43 #<PACKAGE "SNARK-USER">
% 0.14/0.43 *
% 0.14/0.43 SNARK-TPTP-OPTIONS
% 0.14/0.43 *
% 0.14/0.43 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.44 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.44 (USE-FACTORING :POS)
% 0.14/0.44 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.44 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.44 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.44 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.44 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.44 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.44 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.44 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.44 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.44 (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.44 *
% 0.14/0.44 "."
% 0.14/0.44 *
% 0.14/0.44 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T13:44:51
% 0.14/0.44 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-14T13:44:51
% 0.14/0.45
% 0.14/0.45 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.14/0.45 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.14/0.45 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.14/0.45 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.14/0.45 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.14/0.45 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.14/0.45 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.14/0.45 ; Declaring greatest_lower_bound to be commutative.
% 0.14/0.45 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.14/0.45 ; Declaring least_upper_bound to be commutative.
% 0.43/0.65 ; Declaring least_upper_bound to be associative-commutative.
% 0.43/0.65
% 0.43/0.65 #||
% 0.43/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.65 % SZS output start Refutation
% See solution above
% 0.43/0.65 ||#
% 0.43/0.65
% 0.43/0.65 ; Summary of computation:
% 0.43/0.65 ; 1460 formulas have been input or derived (from 37 formulas).
% 0.43/0.65 ; 215 (15%) were retained. Of these,
% 0.43/0.65 ; 6 ( 3%) were simplified or subsumed later,
% 0.43/0.65 ; 209 (97%) are still being kept.
% 0.43/0.65 ;
% 0.43/0.65 ; Run time in seconds:
% 0.43/0.65 ; 0.003 1% Read assertion file (1 call)
% 0.43/0.65 ; 0.001 0% Assert (18 calls)
% 0.43/0.65 ; 0.019 9% Process new row (1,269 calls)
% 0.43/0.65 ; 0.000 0% Resolution (72 calls)
% 0.43/0.65 ; 0.037 17% Paramodulation (36 calls)
% 0.43/0.65 ; 0.003 1% Embedding (103 calls)
% 0.43/0.65 ; 0.115 53% Forward simplification (1,170 calls)
% 0.43/0.65 ; 0.004 2% Backward simplification (116 calls)
% 0.43/0.65 ; 0.003 1% Ordering (1,121 calls)
% 0.43/0.65 ; 0.003 1% Ordering ac (400 calls)
% 0.43/0.65 ; 0.000 0% Sortal reasoning (32 calls)
% 0.43/0.65 ; 0.000 0% Purity testing (1 call)
% 0.43/0.65 ; 0.029 13% Other
% 0.43/0.65 ; 0.217 Total
% 0.43/0.65 ; 0.218 Real time
% 0.43/0.65 ;
% 0.43/0.65 ; Term-hash-array has 619 terms in all.
% 0.43/0.65 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.43/0.65 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.43/0.65 ; Path-index has 609 entries (609 at peak, 623 added, 14 deleted).
% 0.43/0.65 ; Path-index has 369 nodes (369 at peak, 369 added, 0 deleted).
% 0.43/0.65 ; Trie-index has 609 entries (609 at peak, 623 added, 14 deleted).
% 0.43/0.65 ; Trie-index has 210 nodes (210 at peak, 210 added, 0 deleted).
% 0.43/0.65 ; Retrieved 154,941 generalization terms in 11,353 calls.
% 0.43/0.65 ; Retrieved 342 instance terms in 139 calls.
% 0.43/0.65 ; Retrieved 2,554 unifiable terms in 183 calls.
% 0.43/0.65 ;
% 0.43/0.65 ; The agenda of rows to process has 130 entries:
% 0.43/0.65 ; 1 with value 15 9 with value 24 2 with value 33
% 0.43/0.65 ; 8 with value 16 1 with value 25 1 with value 34
% 0.43/0.65 ; 6 with value 18 8 with value 26 4 with value 35
% 0.43/0.65 ; 8 with value 19 3 with value 27 8 with value 37
% 0.43/0.65 ; 7 with value 20 12 with value 28 1 with value 39
% 0.43/0.65 ; 7 with value 21 5 with value 29 1 with value 41
% 0.43/0.65 ; 4 with value 22 17 with value 31 1 with value 47
% 0.43/0.65 ; 15 with value 23 1 with value 32
% 0.43/0.65 ; The agenda of rows to give has 172 entries:
% 0.43/0.65 ; 7 with value (4 12) 14 with value (4 19) 4 with value (4 27)
% 0.43/0.65 ; 1 with value (4 13) 9 with value (4 20) 12 with value (4 28)
% 0.43/0.65 ; 4 with value (4 14) 32 with value (4 21) 4 with value (4 30)
% 0.43/0.65 ; 13 with value (4 15) 14 with value (4 22) 4 with value (4 31)
% 0.43/0.65 ; 10 with value (4 16) 10 with value (4 23) 4 with value (4 33)
% 0.43/0.65 ; 10 with value (4 17) 4 with value (4 24) 4 with value (4 36)
% 0.43/0.65 ; 8 with value (4 18) 4 with value (4 25)
% 0.43/0.65 Evaluation took:
% 0.43/0.65 0.218 seconds of real time
% 0.43/0.65 0.205307 seconds of user run time
% 0.43/0.65 0.013173 seconds of system run time
% 0.43/0.65 [Run times include 0.006 seconds GC run time.]
% 0.43/0.65 0 calls to %EVAL
% 0.43/0.65 0 page faults and
% 0.43/0.65 13,651,992 bytes consed.
% 0.43/0.65 :PROOF-FOUND
% 0.43/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T13:44:52
% 0.43/0.65 :PROOF-FOUND
% 0.43/0.65 *
%------------------------------------------------------------------------------