TSTP Solution File: GRP170-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP170-3 : 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.85s 1.00s
% Output : Refutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 6 RR)
% Number of literals : 13 ( 12 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(glb_absorbtion,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(monotony_glb1,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p03c_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03c_1) ).
cnf(p03c_2,hypothesis,
least_upper_bound(c,d) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03c_2) ).
cnf(prove_p03c,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03c) ).
cnf(35,plain,
greatest_lower_bound(c,d) = c,
inference('PARAMODULATE',[status(thm)],[glb_absorbtion,p03c_2,theory(equality)]) ).
cnf(37,plain,
greatest_lower_bound(a,b) = a,
inference('PARAMODULATE',[status(thm)],[glb_absorbtion,p03c_1,theory(equality)]) ).
cnf(119,plain,
multiply(X,c) = greatest_lower_bound(multiply(X,c),multiply(X,d)),
inference('PARAMODULATE',[status(thm)],[monotony_glb1,35,theory(equality)]) ).
cnf(120,plain,
greatest_lower_bound(multiply(X,c),greatest_lower_bound(multiply(X,d),Y)) = greatest_lower_bound(multiply(X,c),Y),
inference('EMBED',[status(thm)],[119]) ).
cnf(127,plain,
multiply(a,X) = greatest_lower_bound(multiply(a,X),multiply(b,X)),
inference('PARAMODULATE',[status(thm)],[monotony_glb2,37,theory(equality)]) ).
cnf(128,plain,
greatest_lower_bound(multiply(a,X),greatest_lower_bound(multiply(b,X),Y)) = greatest_lower_bound(multiply(a,X),Y),
inference('EMBED',[status(thm)],[127]) ).
cnf(492,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[120,128,theory(equality)]),prove_p03c,127,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP170-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 10:14:20 EDT 2022
% 0.14/0.35 % 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-13T10:14:21
% 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-13T10:14:21
% 0.22/0.51
% 0.22/0.51 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.22/0.51 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.22/0.51 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.22/0.51 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.22/0.51 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.22/0.51 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.22/0.51 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.22/0.51 ; Declaring greatest_lower_bound to be commutative.
% 0.22/0.51 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.22/0.51 ; Declaring least_upper_bound to be commutative.
% 0.85/1.00 ; Declaring least_upper_bound to be associative-commutative.
% 0.85/1.00
% 0.85/1.00 #||
% 0.85/1.00 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.85/1.00 % SZS output start Refutation
% See solution above
% 0.85/1.00 ||#
% 0.85/1.00
% 0.85/1.00 ; Summary of computation:
% 0.85/1.00 ; 2567 formulas have been input or derived (from 67 formulas).
% 0.85/1.00 ; 492 (19%) were retained. Of these,
% 0.85/1.00 ; 30 ( 6%) were simplified or subsumed later,
% 0.85/1.00 ; 462 (94%) are still being kept.
% 0.85/1.00 ;
% 0.85/1.00 ; Run time in seconds excluding printing time:
% 0.85/1.00 ; 0.003 1% Read assertion file (1 call)
% 0.85/1.00 ; 0.001 0% Assert (18 calls)
% 0.85/1.00 ; 0.060 12% Process new row (2,426 calls)
% 0.85/1.00 ; 0.000 0% Resolution (132 calls)
% 0.85/1.00 ; 0.056 11% Paramodulation (66 calls)
% 0.85/1.00 ; 0.007 1% Embedding (233 calls)
% 0.85/1.00 ; 0.308 62% Forward simplification (2,197 calls)
% 0.85/1.00 ; 0.010 2% Backward simplification (263 calls)
% 0.85/1.00 ; 0.010 2% Ordering (3,394 calls)
% 0.85/1.00 ; 0.006 1% Ordering ac (1,082 calls)
% 0.85/1.00 ; 0.001 0% Sortal reasoning (32 calls)
% 0.85/1.00 ; 0.000 0% Purity testing (1 call)
% 0.85/1.00 ; 0.036 7% Other
% 0.85/1.00 ; 0.498 Total
% 0.85/1.00 ; 0.499 Real time
% 0.85/1.00 ;
% 0.85/1.00 ; Term-hash-array has 1,475 terms in all.
% 0.85/1.00 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.85/1.00 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.85/1.00 ; Path-index has 1,401 entries (1,401 at peak, 1,490 added, 89 deleted).
% 0.85/1.00 ; Path-index has 738 nodes (738 at peak, 750 added, 12 deleted).
% 0.85/1.00 ; Trie-index has 1,401 entries (1,401 at peak, 1,490 added, 89 deleted).
% 0.85/1.00 ; Trie-index has 576 nodes (576 at peak, 619 added, 43 deleted).
% 0.85/1.00 ; Retrieved 501,337 generalization terms in 21,057 calls.
% 0.85/1.00 ; Retrieved 572 instance terms in 286 calls.
% 0.85/1.00 ; Retrieved 9,587 unifiable terms in 368 calls.
% 0.85/1.00 ;
% 0.85/1.00 ; The agenda of rows to process has 56 entries:
% 0.85/1.00 ; 4 with value 21 2 with value 27 8 with value 33
% 0.85/1.00 ; 3 with value 23 3 with value 28 2 with value 34
% 0.85/1.00 ; 4 with value 24 18 with value 29 1 with value 35
% 0.85/1.00 ; 4 with value 25 3 with value 31 1 with value 38
% 0.85/1.00 ; 2 with value 26 1 with value 32
% 0.85/1.00 ; The agenda of rows to give has 395 entries:
% 0.85/1.00 ; 22 with value (4 16) 54 with value (4 23) 4 with value (4 29)
% 0.85/1.00 ; 16 with value (4 17) 46 with value (4 24) 14 with value (4 30)
% 0.85/1.00 ; 28 with value (4 18) 28 with value (4 25) 6 with value (4 31)
% 0.85/1.00 ; 46 with value (4 19) 28 with value (4 26) 4 with value (4 33)
% 0.85/1.00 ; 17 with value (4 20) 18 with value (4 27) 8 with value (4 36)
% 0.85/1.00 ; 18 with value (4 21) 18 with value (4 28) 2 with value (4 37)
% 0.85/1.00 ; 18 with value (4 22)
% 0.85/1.00 Evaluation took:
% 0.85/1.00 0.499 seconds of real time
% 0.85/1.00 0.476013 seconds of user run time
% 0.85/1.00 0.02377 seconds of system run time
% 0.85/1.00 [Run times include 0.011 seconds GC run time.]
% 0.85/1.00 0 calls to %EVAL
% 0.85/1.00 0 page faults and
% 0.85/1.00 27,068,912 bytes consed.
% 0.85/1.00 :PROOF-FOUND
% 0.85/1.00 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:14:21
% 0.85/1.00 :PROOF-FOUND
% 0.85/1.00 *
%------------------------------------------------------------------------------