%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HEN007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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 13:02:26 EDT 2022
% Result : Unsatisfiable 0.90s 1.13s
% Output : Refutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 28 unt; 0 nHn; 30 RR)
% Number of literals : 46 ( 7 equ; 13 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal,axiom,
( ~ less_equal(X,Y)
| quotient(X,Y,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X,Y,zero)
| less_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(divisor_existence,axiom,
( ~ quotient(X,Y,Z)
| less_equal(Z,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(quotient_property,axiom,
( ~ quotient(X,Y,Z)
| ~ quotient(Y,U,V)
| ~ quotient(X,U,W)
| ~ quotient(W,V,X1)
| ~ quotient(Z,U,Y1)
| less_equal(X1,Y1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| X = Y ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(closure,axiom,
quotient(X,Y,divide(X,Y)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(well_defined,axiom,
( ~ quotient(X,Y,Z)
| ~ quotient(X,Y,U)
| Z = U ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',well_defined) ).
cnf(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).
cnf(zQy,hypothesis,
quotient(z,y,zQy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQy) ).
cnf(zQx,hypothesis,
quotient(z,x,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQx) ).
cnf(prove_zQyLEzQx,negated_conjecture,
~ less_equal(zQy,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zQyLEzQx) ).
cnf(14,plain,
quotient(x,y,zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal,xLEy]) ).
cnf(16,plain,
quotient(zero,X,zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal,zero_is_smallest]) ).
cnf(18,plain,
less_equal(zQx,z),
inference('HYPERRESOLVE',[status(thm)],[divisor_existence,zQx]) ).
cnf(21,plain,
less_equal(divide(X,Y),X),
inference('HYPERRESOLVE',[status(thm)],[divisor_existence,closure]) ).
cnf(24,plain,
less_equal(divide(zQy,divide(x,y)),divide(zQx,y)),
inference('HYPERRESOLVE',[status(thm)],[quotient_property,zQx,closure,zQy,closure,closure]) ).
cnf(37,plain,
quotient(zQx,z,zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal,18]) ).
cnf(39,plain,
zero = divide(x,y),
inference('HYPERRESOLVE',[status(thm)],[well_defined,14,closure]) ).
cnf(40,plain,
less_equal(divide(zQy,zero),divide(zQx,y)),
inference('REWRITE',[status(thm)],[24,39,theory(equality)]) ).
cnf(61,plain,
less_equal(divide(divide(zQx,y),zQy),zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_property,37,zQy,closure,closure,16]) ).
cnf(73,plain,
quotient(divide(zQy,zero),divide(zQx,y),zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal,40]) ).
cnf(93,plain,
less_equal(divide(divide(zQy,divide(zQx,y)),zero),zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_property,73,closure,16,closure,closure]) ).
cnf(102,plain,
divide(divide(zQx,y),zQy) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,61,zero_is_smallest]) ).
cnf(123,plain,
quotient(divide(zQx,y),zQy,zero),
inference('PARAMODULATE',[status(thm)],[closure,102,theory(equality)]) ).
cnf(124,plain,
less_equal(divide(zQx,y),zQy),
inference('HYPERRESOLVE',[status(thm)],[less_equal_quotient,123]) ).
cnf(198,plain,
divide(divide(zQy,divide(zQx,y)),zero) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,93,zero_is_smallest]) ).
cnf(318,plain,
quotient(divide(zQy,divide(zQx,y)),zero,zero),
inference('PARAMODULATE',[status(thm)],[closure,198,theory(equality)]) ).
cnf(322,plain,
less_equal(divide(zQy,divide(zQx,y)),zero),
inference('HYPERRESOLVE',[status(thm)],[less_equal_quotient,318]) ).
cnf(325,plain,
divide(zQy,divide(zQx,y)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,322,zero_is_smallest]) ).
cnf(375,plain,
quotient(zQy,divide(zQx,y),zero),
inference('PARAMODULATE',[status(thm)],[closure,325,theory(equality)]) ).
cnf(380,plain,
less_equal(zQy,divide(zQx,y)),
inference('HYPERRESOLVE',[status(thm)],[less_equal_quotient,375]) ).
cnf(383,plain,
zQy = divide(zQx,y),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,380,124]) ).
cnf(406,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[21,383,theory(equality)]),prove_zQyLEzQx]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 13:44:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T13:44:23
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-01T13:44:23
% 0.18/0.48
% 0.18/0.48 ; Recognized relation function assertion (|quotient| ?X ?Y (|divide| ?X ?Y)).
% 0.90/1.13 ; Recognized relation functionality assertion (OR (NOT (|quotient| ?X ?Y ?Z)) (NOT (|quotient| ?X ?Y ?U)) (= ?Z ?U)).
% 0.90/1.13
% 0.90/1.13 #||
% 0.90/1.13 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.90/1.13 % SZS output start Refutation
% See solution above
% 0.90/1.13 ||#
% 0.90/1.13
% 0.90/1.13 ; Summary of computation:
% 0.90/1.13 ; 19599 formulas have been input or derived (from 168 formulas).
% 0.90/1.13 ; 406 ( 2%) were retained. Of these,
% 0.90/1.13 ; 161 (40%) were simplified or subsumed later,
% 0.90/1.13 ; 245 (60%) are still being kept.
% 0.90/1.13 ;
% 0.90/1.13 ; Run time in seconds excluding printing time:
% 0.90/1.13 ; 0.003 0% Read assertion file (1 call)
% 0.90/1.13 ; 0.001 0% Assert (13 calls)
% 0.90/1.13 ; 0.055 8% Process new row (12,336 calls)
% 0.90/1.13 ; 0.425 64% Resolution (334 calls)
% 0.90/1.13 ; 0.012 2% Paramodulation (167 calls)
% 0.90/1.13 ; 0.000 0% Condensing (6 calls)
% 0.90/1.13 ; 0.001 0% Forward subsumption (6 calls)
% 0.90/1.13 ; 0.000 0% Backward subsumption (6 calls)
% 0.90/1.13 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.90/1.13 ; 0.088 13% Forward simplification (12,292 calls)
% 0.90/1.13 ; 0.009 1% Backward simplification (406 calls)
% 0.90/1.13 ; 0.000 0% Ordering (1,091 calls)
% 0.90/1.13 ; 0.000 0% Sortal reasoning (32 calls)
% 0.90/1.13 ; 0.000 0% Purity testing (1 call)
% 0.90/1.13 ; 0.069 10% Other
% 0.90/1.13 ; 0.663 Total
% 0.90/1.13 ; 0.666 Real time
% 0.90/1.13 ;
% 0.90/1.13 ; Term-hash-array has 969 terms in all.
% 0.90/1.13 ; Feature-vector-row-index has 6 entries (6 at peak, 6 added, 0 deleted).
% 0.90/1.13 ; Feature-vector-row-index has 12 nodes (12 at peak, 12 added, 0 deleted).
% 0.90/1.13 ; Retrieved 1 possibly forward subsuming row in 6 calls.
% 0.90/1.13 ; Retrieved 1 possibly backward subsumed row in 6 calls.
% 0.90/1.13 ; Path-index has 643 entries (741 at peak, 1,001 added, 358 deleted).
% 0.90/1.13 ; Path-index has 642 nodes (655 at peak, 749 added, 107 deleted).
% 0.90/1.13 ; Trie-index has 643 entries (741 at peak, 1,001 added, 358 deleted).
% 0.90/1.13 ; Trie-index has 2,654 nodes (3,006 at peak, 3,928 added, 1,274 deleted).
% 0.90/1.13 ; Retrieved 41,460 generalization terms in 34,639 calls.
% 0.90/1.13 ; Retrieved 760 instance terms in 399 calls.
% 0.90/1.13 ; Retrieved 247,728 unifiable terms in 87,446 calls.
% 0.90/1.13 ;
% 0.90/1.13 ; The agenda of rows to process has 22 entries:
% 0.90/1.13 ; 3 with value 16 2 with value 21 3 with value 24
% 0.90/1.13 ; 4 with value 18 5 with value 23 3 with value 25
% 0.90/1.13 ; 2 with value 19
% 0.90/1.13 ; The agenda of rows to give has 146 entries:
% 0.90/1.13 ; 2 with value (4 17) 13 with value (4 22) 8 with value (4 27)
% 0.90/1.13 ; 13 with value (4 18) 16 with value (4 23) 1 with value (4 28)
% 0.90/1.13 ; 7 with value (4 19) 15 with value (4 24) 2 with value (4 29)
% 0.90/1.13 ; 17 with value (4 20) 18 with value (4 25) 4 with value (4 30)
% 0.90/1.13 ; 15 with value (4 21) 11 with value (4 26) 4 with value (4 31)
% 0.90/1.13 Evaluation took:
% 0.90/1.13 0.666 seconds of real time
% 0.90/1.13 0.616868 seconds of user run time
% 0.90/1.13 0.049266 seconds of system run time
% 0.90/1.13 [Run times include 0.018 seconds GC run time.]
% 0.90/1.13 0 calls to %EVAL
% 0.90/1.13 0 page faults and
% 0.90/1.13 60,096,344 bytes consed.
% 0.90/1.13 :PROOF-FOUND
% 0.90/1.13 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T13:44:23
% 0.90/1.13 :PROOF-FOUND
% 0.90/1.13 *
%------------------------------------------------------------------------------