TSTP Solution File: GRP171-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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.51s 0.73s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 6 RR)
% Number of literals : 12 ( 11 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 10 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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_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(p04c_1,hypothesis,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04c_1) ).
cnf(p04c_2,hypothesis,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04c_2) ).
cnf(prove_p04c,negated_conjecture,
greatest_lower_bound(identity,multiply(a,b)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04c) ).
cnf(35,plain,
greatest_lower_bound(identity,b) = identity,
inference('PARAMODULATE',[status(thm)],[glb_absorbtion,p04c_2,theory(equality)]) ).
cnf(36,plain,
greatest_lower_bound(identity,greatest_lower_bound(b,X)) = greatest_lower_bound(identity,X),
inference('EMBED',[status(thm)],[35]) ).
cnf(37,plain,
greatest_lower_bound(identity,a) = identity,
inference('PARAMODULATE',[status(thm)],[glb_absorbtion,p04c_1,theory(equality)]) ).
cnf(127,plain,
X = greatest_lower_bound(X,multiply(a,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,37,theory(equality)]),left_identity,theory(equality)]) ).
cnf(128,plain,
greatest_lower_bound(X,greatest_lower_bound(multiply(a,X),Y)) = greatest_lower_bound(X,Y),
inference('EMBED',[status(thm)],[127]) ).
cnf(241,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[36,128,theory(equality)]),prove_p04c,35,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n023.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 08:47:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:47:36
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-13T08:47:36
% 0.20/0.51
% 0.20/0.51 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.51 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.20/0.51 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.20/0.51 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.20/0.51 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.20/0.51 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.20/0.51 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.20/0.51 ; Declaring greatest_lower_bound to be commutative.
% 0.20/0.51 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.20/0.51 ; Declaring least_upper_bound to be commutative.
% 0.51/0.73 ; Declaring least_upper_bound to be associative-commutative.
% 0.51/0.73
% 0.51/0.73 #||
% 0.51/0.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.73 % SZS output start Refutation
% See solution above
% 0.51/0.73 ||#
% 0.51/0.73
% 0.51/0.73 ; Summary of computation:
% 0.51/0.73 ; 1508 formulas have been input or derived (from 40 formulas).
% 0.51/0.73 ; 241 (16%) were retained. Of these,
% 0.51/0.73 ; 26 (11%) were simplified or subsumed later,
% 0.51/0.73 ; 215 (89%) are still being kept.
% 0.51/0.73 ;
% 0.51/0.73 ; Run time in seconds excluding printing time:
% 0.51/0.73 ; 0.004 2% Read assertion file (1 call)
% 0.51/0.73 ; 0.001 0% Assert (18 calls)
% 0.51/0.73 ; 0.030 13% Process new row (1,315 calls)
% 0.51/0.73 ; 0.003 1% Resolution (78 calls)
% 0.51/0.73 ; 0.027 11% Paramodulation (39 calls)
% 0.51/0.73 ; 0.003 1% Embedding (112 calls)
% 0.51/0.73 ; 0.127 53% Forward simplification (1,207 calls)
% 0.51/0.73 ; 0.008 3% Backward simplification (133 calls)
% 0.51/0.73 ; 0.004 2% Ordering (1,219 calls)
% 0.51/0.73 ; 0.004 2% Ordering ac (404 calls)
% 0.51/0.73 ; 0.000 0% Sortal reasoning (32 calls)
% 0.51/0.73 ; 0.000 0% Purity testing (1 call)
% 0.51/0.73 ; 0.028 12% Other
% 0.51/0.73 ; 0.239 Total
% 0.51/0.73 ; 0.241 Real time
% 0.51/0.73 ;
% 0.51/0.73 ; Term-hash-array has 685 terms in all.
% 0.51/0.73 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.51/0.73 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.51/0.73 ; Path-index has 633 entries (633 at peak, 699 added, 66 deleted).
% 0.51/0.73 ; Path-index has 385 nodes (385 at peak, 411 added, 26 deleted).
% 0.51/0.73 ; Trie-index has 633 entries (633 at peak, 699 added, 66 deleted).
% 0.51/0.73 ; Trie-index has 253 nodes (253 at peak, 287 added, 34 deleted).
% 0.51/0.73 ; Retrieved 157,097 generalization terms in 11,496 calls.
% 0.51/0.73 ; Retrieved 369 instance terms in 156 calls.
% 0.51/0.73 ; Retrieved 2,590 unifiable terms in 199 calls.
% 0.51/0.73 ;
% 0.51/0.73 ; The agenda of rows to process has 132 entries:
% 0.51/0.73 ; 2 with value 15 15 with value 24 1 with value 33
% 0.51/0.73 ; 1 with value 16 9 with value 25 2 with value 34
% 0.51/0.73 ; 8 with value 17 1 with value 26 1 with value 35
% 0.51/0.73 ; 6 with value 19 8 with value 27 4 with value 36
% 0.51/0.73 ; 8 with value 20 3 with value 28 8 with value 38
% 0.51/0.73 ; 7 with value 21 12 with value 29 1 with value 40
% 0.51/0.73 ; 7 with value 22 5 with value 30 1 with value 42
% 0.51/0.73 ; 4 with value 23 17 with value 32 1 with value 48
% 0.51/0.73 ; The agenda of rows to give has 175 entries:
% 0.51/0.73 ; 4 with value (4 12) 17 with value (4 20) 4 with value (4 27)
% 0.51/0.73 ; 13 with value (4 13) 16 with value (4 21) 12 with value (4 28)
% 0.51/0.73 ; 5 with value (4 15) 20 with value (4 22) 4 with value (4 30)
% 0.51/0.73 ; 8 with value (4 16) 10 with value (4 23) 4 with value (4 31)
% 0.51/0.73 ; 12 with value (4 17) 6 with value (4 24) 4 with value (4 33)
% 0.51/0.73 ; 14 with value (4 18) 4 with value (4 25) 4 with value (4 36)
% 0.51/0.73 ; 10 with value (4 19) 4 with value (4 26)
% 0.51/0.73 Evaluation took:
% 0.51/0.73 0.241 seconds of real time
% 0.51/0.73 0.22994 seconds of user run time
% 0.51/0.73 0.010736 seconds of system run time
% 0.51/0.73 [Run times include 0.005 seconds GC run time.]
% 0.51/0.73 0 calls to %EVAL
% 0.51/0.73 0 page faults and
% 0.51/0.73 14,238,640 bytes consed.
% 0.51/0.73 :PROOF-FOUND
% 0.51/0.73 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:47:36
% 0.51/0.73 :PROOF-FOUND
% 0.51/0.73 *
%------------------------------------------------------------------------------