TSTP Solution File: ALG004-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ALG004-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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 : Thu Jul 14 17:59:35 EDT 2022
% Result : Unsatisfiable 3.65s 3.87s
% Output : Refutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 15 unt; 0 nHn; 9 RR)
% Number of literals : 21 ( 20 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_cancellation,axiom,
( multiply(X,Y) != Z
| multiply(U,Y) != Z
| X = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_cancellation) ).
cnf(right_cancelaation,axiom,
( multiply(X,Y) != Z
| multiply(X,U) != Z
| Y = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_cancelaation) ).
cnf(medial_law,axiom,
multiply(multiply(X,Y),multiply(Z,U)) = multiply(multiply(X,Z),multiply(Y,U)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',medial_law) ).
cnf(prove_quotient_condition1,negated_conjecture,
multiply(b,b0) = multiply(a,a0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_quotient_condition1) ).
cnf(prove_quotient_condition2,negated_conjecture,
multiply(d,b0) = multiply(c,a0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_quotient_condition2) ).
cnf(prove_quotient_condition3,negated_conjecture,
multiply(b,d0) = multiply(a,c0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_quotient_condition3) ).
cnf(prove_quotient_condition4,negated_conjecture,
multiply(d,d0) != multiply(c,c0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_quotient_condition4) ).
cnf(17,plain,
multiply(multiply(X,Y),multiply(d,d0)) != multiply(multiply(X,c),multiply(Y,c0)),
inference('UR-RESOLVE',[status(thm)],[right_cancelaation,medial_law,prove_quotient_condition4]) ).
cnf(21,plain,
multiply(multiply(a,a0),multiply(X,Y)) = multiply(multiply(b,X),multiply(b0,Y)),
inference('PARAMODULATE',[status(thm)],[medial_law,prove_quotient_condition1,theory(equality)]) ).
cnf(22,plain,
multiply(multiply(c,a0),multiply(X,Y)) = multiply(multiply(d,X),multiply(b0,Y)),
inference('PARAMODULATE',[status(thm)],[medial_law,prove_quotient_condition2,theory(equality)]) ).
cnf(26,plain,
multiply(multiply(multiply(X,Y),multiply(Z,U)),multiply(V,W)) = multiply(multiply(multiply(X,Z),V),multiply(multiply(Y,U),W)),
inference('PARAMODULATE',[status(thm)],[medial_law,medial_law,theory(equality)]) ).
cnf(54,plain,
multiply(multiply(multiply(X,c),multiply(Y,c0)),multiply(Z,U)) != multiply(multiply(multiply(X,Y),Z),multiply(multiply(d,d0),U)),
inference('UR-RESOLVE',[status(thm)],[left_cancellation,17,medial_law]) ).
cnf(75,plain,
multiply(multiply(b,X),multiply(b0,Y)) = multiply(multiply(a,X),multiply(a0,Y)),
inference('PARAMODULATE',[status(thm)],[medial_law,21,theory(equality)]) ).
cnf(76,plain,
multiply(multiply(d,X),multiply(b0,Y)) = multiply(multiply(c,X),multiply(a0,Y)),
inference('PARAMODULATE',[status(thm)],[medial_law,22,theory(equality)]) ).
cnf(117,plain,
multiply(multiply(a,c0),multiply(b0,X)) = multiply(multiply(a,d0),multiply(a0,X)),
inference('PARAMODULATE',[status(thm)],[75,prove_quotient_condition3,theory(equality)]) ).
cnf(697,plain,
multiply(multiply(multiply(X,Y),multiply(Z,U)),multiply(multiply(V,W),X1)) = multiply(multiply(multiply(X,V),multiply(Y,U)),multiply(multiply(Z,W),X1)),
inference('PARAMODULATE',[status(thm)],[26,26,theory(equality)]) ).
cnf(2250,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,117,theory(equality)]),697,76,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ALG004-1 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n028.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 : Wed Jun 8 19:59:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T19:59:16
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-08T19:59:16
% 3.65/3.87
% 3.65/3.87
% 3.65/3.87 #||
% 3.65/3.87 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/3.87 % SZS output start Refutation
% See solution above
% 3.65/3.89 ||#
% 3.65/3.89
% 3.65/3.89 ; Summary of computation:
% 3.65/3.89 ; 14446 formulas have been input or derived (from 103 formulas).
% 3.65/3.89 ; 2250 (16%) were retained. Of these,
% 3.65/3.89 ; 25 ( 1%) were simplified or subsumed later,
% 3.65/3.89 ; 2225 (99%) are still being kept.
% 3.65/3.89 ;
% 3.65/3.89 ; Run time in seconds excluding printing time:
% 3.65/3.89 ; 0.002 0% Read assertion file (1 call)
% 3.65/3.89 ; 0.000 0% Assert (7 calls)
% 3.65/3.89 ; 0.352 10% Process new row (13,396 calls)
% 3.65/3.89 ; 0.367 11% Resolution (204 calls)
% 3.65/3.89 ; 0.088 3% Paramodulation (102 calls)
% 3.65/3.89 ; 0.001 0% Condensing (106 calls)
% 3.65/3.89 ; 0.007 0% Forward subsumption (106 calls)
% 3.65/3.89 ; 0.002 0% Backward subsumption (52 calls)
% 3.65/3.89 ; 0.008 0% Clause clause subsumption (279 calls)
% 3.65/3.89 ; 1.221 36% Forward simplification (12,759 calls)
% 3.65/3.89 ; 0.110 3% Backward simplification (2,250 calls)
% 3.65/3.89 ; 1.163 34% Ordering (136,215 calls)
% 3.65/3.89 ; 0.000 0% Sortal reasoning (32 calls)
% 3.65/3.89 ; 0.000 0% Purity testing (1 call)
% 3.65/3.89 ; 0.074 2% Other
% 3.65/3.89 ; 3.395 Total
% 3.65/3.89 ; 3.410 Real time
% 3.65/3.89 ;
% 3.65/3.89 ; Term-hash-array has 9,171 terms in all.
% 3.65/3.89 ; Feature-vector-row-index has 52 entries (52 at peak, 52 added, 0 deleted).
% 3.65/3.89 ; Feature-vector-row-index has 340 nodes (340 at peak, 340 added, 0 deleted).
% 3.65/3.89 ; Retrieved 468 possibly forward subsuming rows in 106 calls.
% 3.65/3.89 ; Retrieved 20 possibly backward subsumed rows in 52 calls.
% 3.65/3.89 ; Path-index has 9,124 entries (9,124 at peak, 9,227 added, 103 deleted).
% 3.65/3.89 ; Path-index has 901 nodes (901 at peak, 901 added, 0 deleted).
% 3.65/3.89 ; Trie-index has 9,124 entries (9,124 at peak, 9,227 added, 103 deleted).
% 3.65/3.89 ; Trie-index has 51,951 nodes (51,951 at peak, 52,444 added, 493 deleted).
% 3.65/3.89 ; Retrieved 142,332 generalization terms in 165,898 calls.
% 3.65/3.89 ; Retrieved 10,994 instance terms in 2,921 calls.
% 3.65/3.89 ; Retrieved 468,134 unifiable terms in 6,083 calls.
% 3.65/3.89 ;
% 3.65/3.89 ; The agenda of rows to process has 58 entries:
% 3.65/3.89 ; 9 with value 39 4 with value 41 10 with value 47
% 3.65/3.89 ; 10 with value 40 21 with value 43 4 with value 48
% 3.65/3.89 ; The agenda of rows to give has 2128 entries:
% 3.65/3.89 ; 27 with value (4 29) 126 with value (4 36) 144 with value (4 43)
% 3.65/3.89 ; 85 with value (4 30) 67 with value (4 37) 64 with value (4 44)
% 3.65/3.89 ; 80 with value (4 31) 94 with value (4 38) 64 with value (4 45)
% 3.65/3.89 ; 52 with value (4 32) 298 with value (4 39) 8 with value (4 46)
% 3.65/3.89 ; 79 with value (4 33) 238 with value (4 40) 76 with value (4 47)
% 3.65/3.89 ; 183 with value (4 34) 176 with value (4 41) 36 with value (4 48)
% 3.65/3.89 ; 212 with value (4 35) 19 with value (4 42)
% 3.65/3.89 Evaluation took:
% 3.65/3.89 3.41 seconds of real time
% 3.65/3.89 3.171067 seconds of user run time
% 3.65/3.89 0.238946 seconds of system run time
% 3.65/3.89 [Run times include 0.213 seconds GC run time.]
% 3.65/3.89 0 calls to %EVAL
% 3.65/3.89 0 page faults and
% 3.65/3.89 227,048,896 bytes consed.
% 3.65/3.89 :PROOF-FOUND
% 3.65/3.89 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T19:59:20
% 3.65/3.89 :PROOF-FOUND
% 3.65/3.89 *
%------------------------------------------------------------------------------